×

zbMATH — the first resource for mathematics

On efficient solutions to multiple objective mathematical programs. (English) Zbl 0553.90095
A scalarization result for convex multiobjective programming problems is used to prove that the set of quasi-efficient (or weak efficient) solutions coincides with the set of solutions which are efficient for some subset of the objectives. The authors distinguish between strictly and alternately efficient solutions and give another characterization of quasi-efficiency in terms of these concepts.

MSC:
90C31 Sensitivity, stability, parametric optimization
PDF BibTeX XML Cite
Full Text: DOI