Pages that link to "Item:Q3902847"
From MaRDI portal
The following pages link to Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program (Q3902847):
Displaying 19 items.
- A new algorithm for linear multiobjective programming problems with bounded variables (Q471311) (← 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)
- Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391) (← links)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← 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)
- Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
- Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
- Optimizing a linear function over an efficient set (Q1342462) (← links)
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
- Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. (Q1428193) (← 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)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons (Q1765840) (← links)
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities (Q2114885) (← links)
- Generation of some methods for solving interval multi-objective linear programming models (Q2150482) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
