Characterizations of efficient solutions under polyhedrality assumptions

DOI10.1007/BF01415908MaRDI QIDQ4713650zbMATH OpenDBLPWikidataFDO

Authors Juan-Enrique Martínez-Legaz

Publication date 25 June 1992

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01415908

zbMATH Keywords

efficiencylexicographical order

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• Characterizations of efficient sets by constrained objectives
• Characterisations of efficient sets in vector optimisation
• On efficient solutions in vector optimization
• Characterizing -properly efficient solutions

Cites work

• An improved definition of proper efficiency for vector maximization with respect to cones
• scientific article; zbMATH DE number 3898622 (Why is no real title available?)
• Lexicographic geometric programming
• Lexicographical order and duality in multiobjective programming
• Lexicographical order, lexicographical index, and linear operators
• Lexocographic multipliers
• Linear lexicographic optimization
• Surrogate duality for vector optimization
• Theory of multiobjective optimization

Cited in

(4)

• scientific article; zbMATH DE number 16648 (Why is no real title available?)
• Some further relations between unperturbational and perturbational dual optimization problems
• On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
• On the characterization of efficient production vectors

This page was built for publication: Characterizations of efficient solutions under polyhedrality assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713650)