A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
From MaRDI portal
Publication:1373064
Recommendations
Cited in
(13)- Validity of Local Search in Multiparametric and Vector Linear Programming
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
- scientific article; zbMATH DE number 3963588 (Why is no real title available?)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- scientific article; zbMATH DE number 3858877 (Why is no real title available?)
- Multiple Objective Linear Programming with Parametric Criteria Coefficients
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Optimization over the efficient set
- A parametric simplex algorithm for linear vector optimization problems
- Optimization over the efficient set of a bicriteria convex programming problem
- A parametric simplex algorithm for biobjective piecewise linear programming problems
This page was built for publication: A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373064)