Pages that link to "Item:Q1245073"
From MaRDI portal
The following pages link to A general method for determining the set of all efficient solutions to a linear vectormaximum problem (Q1245073):
Displayed 50 items.
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone (Q684340) (← links)
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- Approaches to sensitivity analysis in linear programming (Q757255) (← links)
- A compromise procedure for the multiple objective linear fractional programming problem (Q761358) (← links)
- On the structure of the set bases of a degenerate point (Q795747) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
- On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
- A graphical subroutine for multiobjective linear programming (Q1055342) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Stability in vector maximization - a survey (Q1074503) (← links)
- Analysis of multicriteria decision aid in Europe (Q1075249) (← links)
- Multiobjective mathematical programming via the MULTIPLEX model and algorithm (Q1076614) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives (Q1095788) (← links)
- Computational experience concerning payoff tables and minimum criterion values over the efficient set (Q1095808) (← links)
- Distributional efficiency in multiobjective stochastic linear programming (Q1127138) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung (Q1144498) (← links)
- Linear programming with partial information (Q1145068) (← links)
- Zielgewichtungskompromisse für lineare Programme mit mehrfacher Zielsetzung (Q1147075) (← links)
- Bicriteria linear fractional programming (Q1148820) (← links)
- Relaxation analysis in linear vectorvalued maximization (Q1154395) (← links)
- An algorithm for bicriterion linear programming (Q1163481) (← links)
- Bicriteria network flow problems: Continuous case (Q1175771) (← links)
- Applications of the parametric programming procedure (Q1179007) (← links)
- A simplified MOLP algorithm: The MOLP-S procedure (Q1184461) (← links)
- Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming (Q1264984) (← links)
- Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) (← links)
- A reduction algorithm for integer multiple objective linear programs (Q1278795) (← links)
- New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
- Approximating the noninferior set in multiobjective linear programming problems (Q1309915) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
- Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
- Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems (Q1319438) (← links)
- Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- An algorithm for systems welfare interactive goal programming modelling (Q1610175) (← links)
- A transportation model with multiple criteria and multiple constraint levels (Q1804945) (← links)
- On the convergence of multiobjective evolutionary algorithms (Q1806943) (← links)
- Multi-objective modeling for engineering applications: DIDASN++ system (Q1807946) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)