Pages that link to "Item:Q1266607"
From MaRDI portal
The following pages link to A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607):
Displaying 17 items.
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
- On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
- Analysis of the objective space in multiple objective linear programming (Q1095043) (← links)
- Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
- New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
- Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← 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 geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306) (← links)
- Generating efficient faces for multiobjective linear programming problems (Q2627318) (← links)
- (Q4963438) (← links)
- Efficient faces of polytopes: Interior point algorithms, parametrization of algebraic varieties, and multiple objective optimization (Q5202836) (← links)
