Pages that link to "Item:Q1245073"

The following pages link to A general method for determining the set of all efficient solutions to a linear vectormaximum problem (Q1245073):

Displaying 9 items.

• Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
• A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
• A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
• An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
• On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
• New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
• The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
• Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem (Q2566581) (← links)