Ideal points in multiobjective programming
Pedro Jiménez Guerra
UC3M Working papers. Economics from Universidad Carlos III de Madrid. Departamento de EconomÃa
Abstract:
The main object of this paper is to give conditions under which a minimal solution to a problem of mathematical programming can be transformed into a minimum solution in the usual sense of the order relations, or in every case, conditions under which that solution is adherent to the set of the points wich verify this last property. The interest of this problem is clear, since many of the usual properties in optimization (like, for instance, the analysis of the sensitivity of the solutions) are studied more easily for minimum solutions than for minimal solutions.
Keywords: Maximal; Optimization; Ordered; Banach; Space; Multiobjetive; Programming; Ideal; Point; Strongly; Proper; Optimum (search for similar items in EconPapers)
Date: 1993-03
References: Add references at CitEc
Citations:
Downloads: (external link)
https://e-archivo.uc3m.es/rest/api/core/bitstreams ... f75c95717571/content (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:cte:werepe:2892
Access Statistics for this paper
More papers in UC3M Working papers. Economics from Universidad Carlos III de Madrid. Departamento de EconomÃa
Bibliographic data for series maintained by Ana Poveda ().