Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming

Cited In (18)

Characterizations of optimality in convex programming: the nondifferentiable case
Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
On efficient sets in vector maximum problems - A brief survey
A simplified test for optimality
Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
Characterizations of optimality in convex programming: the nondifferentiable case
Complete characterization of optimality for convex programming in banach spaces^†
A saddle-point characterization of Pareto optima
Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
Stability of efficiency evaluations in data envelopment analysis
Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method
A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
``Near weighted utilitarian characterizations of Pareto optima
Title not available (Why is that?)
Title not available (Why is that?)
Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives

This page was built for publication: Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming

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