Pages that link to "Item:Q1207046"

The following pages link to A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046):

Displaying 14 items.

• Generating equidistant representations in biobjective programming (Q429518) (← links)
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Optimizing a linear function over an efficient set (Q1342462) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← 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 new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
• Dual approach to minimization on the set of Pareto-optimal solutions (Q1918295) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set (Q2358305) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming (Q6067899) (← links)