ArticleOriginal scientific text
Title
On localizing global Pareto solutions in a given convex set
Authors 1, 1
Affiliations
- Institute of Mathematics, Technical University of Łódź, Al. Politechniki 11, 90-924 Łódź, Poland
Abstract
Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing with respect to the cone generating the preference relation.
Keywords
sufficient and necessary conditions for optimality, Pareto optimal solutions, dual cones, feasible directions
Bibliography
- B. D. Craven, Mathematical Programming and Control Theory, Halsted, London, 1982.
- R. Engelking, General Topology, Monograf. Mat. 60, PWN, Warszawa, 1977.
- L. Gajek and D. Zagrodny, Existence of maximal points with respect to ordered bipreference relations, J. Optim. Theory Appl. 70 (1991), 355-364.
- L. Gajek and D. Zagrodny, Countably orderable sets and their applications in optimization, Optimization 26 (1992), 287-301.
- L. Gajek and D. Zagrodny, Weierstrass theorem for monotonically semicontinuous functions, ibid. 29 (1994), 199-203.
- B. Pshenichnyĭ, Necessary Conditions for an Extremum, Nauka, Moscow, 1982 (in Russian).
- S. Rolewicz, On drop property, Studia Math. 85 (1987), 27-35.
- W. Rudin, Functional Analysis, Moscow, Mir, 1975 (in Russian); English original: McGraw-Hill, New York, 1973.
- C. Swartz, Pshenichnyĭ's theorem for vector minimization, J. Optim. Theory Appl. 53 (1987), 309-317.
Pages:
383-394
Main language of publication
English
Received
1998-06-19
Accepted
1999-05-31
Published
1999
Exact and natural sciences