Pages that link to "Item:Q1892603"

The following pages link to A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603):

Displaying 15 items.

• Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• Some geometrical aspects of the efficient line in vector optimization (Q706931) (← links)
• Some characterizations of ideal points in vector optimization problems (Q938426) (← 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)
• Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← 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)
• Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
• Global maximization of UTA functions in multi-objective optimization (Q2355087) (← links)
• Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
• (Q4963438) (← links)