Pages that link to "Item:Q1183391"
From MaRDI portal
The following pages link to Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391):
Displayed 9 items.
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- Optimizing a linear function over an efficient set (Q1342462) (← 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)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306) (← links)