Finding all maximal efficient faces in multiobjective linear programming
From MaRDI portal
Publication:1315425
DOI10.1007/BF01582157zbMath0795.90054OpenAlexW1967298113MaRDI QIDQ1315425
Publication date: 14 September 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582157
connectednesssimplex algorithmdegeneracyefficient setmaximal efficient facesmultiobjective linear programlexicographic selection rule
Related Items (33)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ A multiobjective based approach for mathematical programs with linear flexible constraints ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Finding a minimal efficient solution of a convex multiobjective program ⋮ A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming ⋮ Efficient curve fitting: an application of multiobjective programming ⋮ Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Multiple objective programming with piecewise linear functions ⋮ An approach for finding efficient points in multiobjective linear programming ⋮ Neighbourhood search for constructing Pareto sets ⋮ Fully piecewise linear vector optimization problems ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Determining maximal efficient faces in multiobjective linear programming problem ⋮ A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs ⋮ An Algorithm For Solving Multiple Objective Integer Linear Programming Problem ⋮ Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces ⋮ An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications
Cites Work
- On the graph structure of convex polyhedra in \(n\)-space
- On the structure of the set bases of a degenerate point
- Degeneracy graphs and the neighbourhood problem
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Determination of the efficient set in multiobjective linear programming
- Faces of a polyhedron
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding all maximal efficient faces in multiobjective linear programming
