Pages that link to "Item:Q999127"

The following pages link to Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127):

Displaying 9 items.

• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
• A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems (Q1670109) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)