Pages that link to "Item:Q1312767"

The following pages link to On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767):

Displaying 8 items.

• 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)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← 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)
• Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
• (Q4963438) (← links)