Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software

DOI10.1016/S0895-7177(03)00086-4zbMath1080.90067OpenAlexW1974926966MaRDI QIDQ597396

Efim A. Galperin

Publication date: 6 August 2004

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(03)00086-4

zbMATH Keywords

Goal programmingMCDMPareto solutionBalance set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Box-triangular multiobjective linear programs for resource allocation with application to load management and energy market problems. ⋮ Non-causal models in long term planning via set contractive optimal control methods ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• 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
• Balance space in airport construction: Application to the North Sea island option for Schiphol Airport
• A characterization of weakly efficient points
• Retrieval and use of the balance set in multiobjective global optimization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
• Finding all efficient extreme points for multiple objective linear programs
• Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.

This page was built for publication: Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software