A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
From MaRDI portal
Publication:1373064
zbMATH Open0886.90123MaRDI QIDQ1373064FDOQ1373064
Authors: Nguyen Dinh Dan, Le Dung Muu 
Publication date: 5 November 1997
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Recommendations
linear functionmultiple criteria decision makingefficient setbicriteria linear programmingmultiple objektive problemparametric simplex procedure
Cited In (13)
- Validity of Local Search in Multiparametric and Vector Linear Programming
- An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A parametric simplex algorithm for biobjective piecewise linear programming problems
- Optimization over the efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Title not available (Why is that?)
- Optimization over the efficient set of a bicriteria convex programming problem
- Title not available (Why is that?)
- Multiple Objective Linear Programming with Parametric Criteria Coefficients
- A parametric simplex algorithm for linear vector optimization 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)
