Pages that link to "Item:Q1095043"
From MaRDI portal
The following pages link to Analysis of the objective space in multiple objective linear programming (Q1095043):
Displayed 31 items.
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
- A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Solving multiple objective linear programs in objective space (Q749446) (← links)
- Constructing the set of efficient objective values in multiple objective linear programs (Q918870) (← links)
- Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- A representation of the set of feasible objectives in multiple objective linear programs (Q1185063) (← 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)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
- An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors (Q1318454) (← links)
- Constructing the set of efficient objective values in linear multiple objective transportation problems (Q1328608) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
- The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- Solving multiple-objective problems in the objective space (Q1918026) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- Optimization over the efficient set using an active constraint approach (Q3363070) (← links)
- Linear multicriteria sensitivity and shadow costs (Q4327965) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
- Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
- (Q4963438) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)