Pages that link to "Item:Q1908646"
From MaRDI portal
The following pages link to Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646):
Displayed 11 items.
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
- Optimal sequential inspection policies (Q646686) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization (Q1847149) (← links)
- Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
- Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
- DC programming: overview. (Q1969457) (← links)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)