Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.

DOI10.1023/A:1026465906067zbMath1033.90118OpenAlexW259673802MaRDI QIDQ5929428

Efim A. Galperin, Pedro Jiménez Guerra

Publication date: 4 April 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026465906067

zbMATH Keywords

sensitivityvector optimizationparametric programmingduality gaplevel setPareto optimalityprimal-dual balance set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Related Items (12)

Sensitivity of Pareto solutions in multiobjective optimization ⋮ Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Box-triangular multiobjective linear programs for resource allocation with application to load management and energy market problems. ⋮ Orthogonality in multiobjective optimization ⋮ Non-causal models in long term planning via set contractive optimal control methods ⋮ On duality in multiple objective linear programming ⋮ 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 ⋮ Sensitivity in multiobjective optimization: The generalized envolvent theorem ⋮ Radial solutions and orthogonal trajectories in multiobjective global optimization ⋮ Balance space in airport construction: Application to the North Sea island option for Schiphol Airport

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of efficient sets by constrained objectives
• Theory of multiobjective optimization
• Compromise solutions and estimation of the noninferior set
• Multiobjective programming and planning
• A geometric view of parametric linear programming
• Linear multiobjective programming
• Duality theory for infinite-dimensional multiobjective linear programming
• Nonscalarized multiobjective global optimization
• A saddle-point characterization of Pareto optima
• Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
• Equivalence of balance points and Pareto solutions in multiple-objective programming
• A characterization of weakly efficient points
• Scalarizing vector optimization problems
• Sensitivity analysis for convex multiobjective programming in abstract spaces
• Duality theory and slackness conditions in multiobjective linear programming
• Retrieval and use of the balance set in multiobjective global optimization
• Proper efficiency and the theory of vector maximization
• Efficiency in multiple objective optimization problems
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
• Finding all efficient extreme points for multiple objective linear programs
• An interactive weighted Tchebycheff procedure for multiple objective programming

This page was built for publication: Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.