Pages that link to "Item:Q1373064"
From MaRDI portal
The following pages link to A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem (Q1373064):
Displaying 13 items.
- A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
- An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions (Q1265870) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← 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)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625) (← links)
- A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
- Multiple Objective Linear Programming with Parametric Criteria Coefficients (Q3028747) (← links)
- Validity of Local Search in Multiparametric and Vector Linear Programming (Q3789357) (← links)
- Optimization over the efficient set (Q5917733) (← links)