Pages that link to "Item:Q1266607"

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):

Displayed 7 items.

• Constructing efficient solutions structure of multiobjective linear programming (Q557002) ‎ (← 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)
• 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)
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306) ‎ (← links)