A characterization of weakly efficient points

DOI10.1007/BF01585765zbMath0834.90109MaRDI QIDQ1804360

Pascual Ruíz-Canales, Antonio Rufián-Lizana

Publication date: 14 May 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

generalized convexityweakly efficient solutionsmultiobjective optimization problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)

Related Items (21)

The controlled estimation method in the multiobjective linear fractional problem ⋮ Efficiency and generalized concavity ⋮ Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software ⋮ A combined scalarization method for multi-objective optimization problems ⋮ Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization ⋮ On efficient solutions in vector optimization ⋮ AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ A survey of recent developments in multiobjective optimization ⋮ On the set of weakly efficient minimizers for convex multiobjective programming ⋮ 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 ⋮ Generalized convexity in multiobjective programming ⋮ Another approach to multiobjective programming problems with \(F\)-convex functions ⋮ Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization ⋮ Duality in nondifferentiable vector programming ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Invex functions and generalized convexity in multiobjective programming ⋮ AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS ⋮ An \(\eta\)-approximation method in nonlinear vector optimization

Cites Work

• Proper efficiency and the theory of vector maximization
• Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
• Finding all efficient extreme points for multiple objective linear programs
• Unnamed Item

This page was built for publication: A characterization of weakly efficient points