A new method for determining all maximal efficient faces in multiple objective linear programming
From MaRDI portal
Publication:514052
DOI10.1007/s40306-015-0164-6zbMath1357.90141OpenAlexW2318985579MaRDI QIDQ514052
Publication date: 8 March 2017
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-015-0164-6
Related Items
Cites Work
- Unnamed Item
- Determining maximal efficient faces in multiobjective linear programming problem
- 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
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- Degeneracy degrees of constraint collections
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Faces of a polyhedron
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Generating all vertices of a polyhedron is hard
