Finding all maximal efficient faces in multiobjective linear programming
From MaRDI portal
Recommendations
- A new method for determining all maximal efficient faces in multiple objective linear programming
- Determining maximal efficient faces in multiobjective linear programming problem
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear programming
- An approach for finding efficient points in multiobjective linear programming
Cites work
- scientific article; zbMATH DE number 3887462 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Convex Analysis
- Degeneracy graphs and the neighbourhood problem
- Determination of the efficient set in multiobjective linear programming
- Faces of a polyhedron
- Finding all efficient extreme points for multiple objective linear programs
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- Generating all maximal efficient faces for multiple objective linear programs
- Linear multiobjective programming
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On Computing an Initial Efficient Extreme Point
- On the graph structure of convex polyhedra in n-space
- On the structure of the set bases of a degenerate point
- 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
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(41)- 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
- New closedness results for efficient sets in multiple objective mathematical programming
- Generating the weakly efficient set of nonconvex multiobjective problems
- Maximizing a linear fractional function on a Pareto efficient frontier
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
- A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming
- An algorithm for optimizing over the efficient set
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Fully piecewise linear vector optimization problems
- Neighbourhood search for constructing Pareto sets
- Finding a minimal efficient solution of a convex multiobjective program
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Generating efficient faces for multiobjective linear programming problems
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear programming
- 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
- Multiple objective programming with piecewise linear functions
- Constructing efficient solutions structure of multiobjective linear programming
- Efficient curve fitting: an application of multiobjective programming
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- An approach for finding efficient points in multiobjective linear programming
- scientific article; zbMATH DE number 4114407 (Why is no real title available?)
- 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
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming
- scientific article; zbMATH DE number 943301 (Why is no real title available?)
- Outcome space partition of the weight set in multiobjective linear programming
- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
- A new method for determining all maximal efficient faces in multiple objective linear programming
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- A parametric simplex algorithm for linear vector optimization problems
This page was built for publication: Finding all maximal efficient faces in multiobjective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315425)
