Determination of the efficient set in multiobjective linear programming
From MaRDI portal
Publication:1321077
DOI10.1007/BF00941298zbMath0793.90064MaRDI QIDQ1321077
Paul Armand, Christian Malivert
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, 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, Adjacency based method for generating maximal efficient faces in multiobjective linear programming, A bookkeeping strategy for multiple objective linear programs, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Efficient curve fitting: an application of multiobjective programming, Saddle points and scalarizing sets in multiple objective linear programming, Linear multicriteria sensitivity and shadow costs, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, A new method for determining all maximal efficient faces in multiple objective linear programming, A parametric simplex algorithm for linear vector optimization problems, A regression study of the number of efficient extreme points in multiple objective linear programming, Multi-objective decision analysis for competence-oriented project portfolio selection, Constructing efficient solutions structure of multiobjective linear programming, An approach for finding efficient points in multiobjective linear programming, Neighbourhood search for constructing Pareto sets, A semidefinite programming approach for solving multiobjective linear programming, 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, The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs, 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, 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, Bounds on the number of vertices of perturbed polyhedra, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program, Finding all maximal efficient faces in multiobjective linear programming, Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of the set bases of a degenerate point
- Degeneracy graphs and the neighbourhood problem
- 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
- Identifying Efficient Vectors: Some Theory and Computational Results
- 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
- 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
