A general method for determining the set of all efficient solutions to a linear vectormaximum problem
From MaRDI portal
(Redirected from Publication:1245073)
Cites work
- scientific article; zbMATH DE number 3492435 (Why is no real title available?)
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Finding all efficient extreme points for multiple objective linear programs
- Generating all maximal efficient faces for multiple objective linear programs
- Homogene mehrparametrische lineare Programmierung
- Linear multiobjective programming
- Multiparametric Linear Programming
- Proper efficiency and the theory of vector maximization
- Relaxation analysis in linear vectorvalued maximization
- Sensitivitätsanalysen und parametrische Programmierung
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Vektormaximumproblem und parametrische optimierung
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
Cited in
(65)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Bicriteria network flow problems: Continuous case
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- Linear programming with partial information
- Multi-objective modeling for engineering applications: DIDASN++ system
- On efficient sets in vector maximum problems - A brief survey
- Stability in vector maximization - a survey
- An algorithm for bicriterion linear programming
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Outcome space partition of the weight set in multiobjective linear programming
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Approximating the noninferior set in multiobjective linear programming problems
- Multiple objective programming with piecewise linear functions
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- A binary integer linear program with multi-criteria and multi-constraint levels
- Efficient solutions for the bicriteria network flow problem
- Approaches to sensitivity analysis in linear programming
- Multiobjective mathematical programming via the MULTIPLEX model and algorithm
- Distributional efficiency in multiobjective stochastic linear programming
- A compromise procedure for the multiple objective linear fractional programming problem
- Uniform convergence and Pareto optimality
- Zielgewichtungskompromisse für lineare Programme mit mehrfacher Zielsetzung
- Bicriteria linear fractional programming
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Vector linear programming in zero-sum multicriteria matrix games
- New closedness results for efficient sets in multiple objective mathematical programming
- 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
- Selected bibliography on degeneracy
- Optimization over the efficient set
- Hybrid approach for solving multiple-objective linear programs in outcome space
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
- On the convergence of multiobjective evolutionary algorithms
- A reduction algorithm for integer multiple objective linear programs
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- An approach for finding efficient points in multiobjective linear programming
- Applications of the parametric programming procedure
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
- An algorithm for optimizing over the weakly-efficient set
- Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A new method for determining all maximal efficient faces in multiple objective linear programming
- A simplified MOLP algorithm: The MOLP-S procedure
- Finding all maximal efficient faces in multiobjective linear programming
- A regression study of the number of efficient extreme points in multiple objective linear programming
- An exact penalty on bilevel programs with linear vector optimization lower level
- On the structure of the set bases of a degenerate point
- Relaxation analysis in linear vectorvalued maximization
- Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems
- The range of the efficient frontier in multiple objective linear programming
- Determination of the efficient set in multiobjective linear programming
- Analysis of multicriteria decision aid in Europe
- Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung
- The attainment of the solution of the dual program in vertices for vectorial linear programs
- A graphical subroutine for multiobjective linear programming
- A transportation model with multiple criteria and multiple constraint levels
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
- Solving discrete multiobjective optimization problems based on approximation.
- An algorithm for systems welfare interactive goal programming modelling
- Solving a special class of multiple objective linear fractional programming problems
- Discussion and modification of the Fandel-method solving linear vector maximum problems
This page was built for publication: A general method for determining the set of all efficient solutions to a linear vectormaximum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245073)
