Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming

Cited in

(18)

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

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)