ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS

DOI10.1080/02331930290019486zbMath1009.90105OpenAlexW1998767870MaRDI QIDQ4548050

Nguyen Thi Bach Kim, Le Dung Muu

Publication date: 2002

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930290019486

zbMATH Keywords

dimension reductionprojectionoptimization over the efficient setefficient setmultiple objective linear programmingouter and inner approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (4)

Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set ⋮ On DC optimization algorithms for solving minmax flow problems ⋮ Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
• Minimization of a quasi-concave function over an efficient set
• Solving multiple objective linear programs in objective space
• Analysis of the objective space in multiple objective linear programming
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Method for minimizing a convex-concave function over a convex set
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming
• Hybrid approach for solving multiple-objective linear programs in outcome space
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Dual approach to minimization on the set of Pareto-optimal solutions
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Concave minimization under linear constraints with special structure
• Algorithms for the vector maximization problem
• Convex Analysis
• Optimization over the efficient set
• Optimization over the efficient set

This page was built for publication: ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS