Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
From MaRDI portal
Publication:4145431
DOI10.2307/1912673zbMath0367.90093OpenAlexW2044004265MaRDI QIDQ4145431
Adi Ben-Israel, Aharon Ben-Tal, A. Charnes
Publication date: 1977
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1912673
Related Items
A saddle-point characterization of Pareto optima, Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software, Unnamed Item, 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, Unnamed Item, Stability of efficiency evaluations in data envelopment analysis, Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors., Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives, Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization, Characterizations of optimality in convex programming: the nondifferentiable case, A simplified test for optimality, Characterizations of optimality in convex programming: the nondifferentiable case, Complete characterization of optimality for convex programming in banach spaces†, AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS, On efficient sets in vector maximum problems - A brief survey, Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
