Sciweavers

3221 search results - page 55 / 645
» Termination of Linear Programs
Sort
View
SIAMJO
2002
105views more  SIAMJO 2002»
13 years 7 months ago
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
E. Alper Yildirim, Michael J. Todd
AMC
2006
107views more  AMC 2006»
13 years 8 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
COR
2004
291views more  COR 2004»
13 years 7 months ago
Cycling in linear programming problems
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
Saul I. Gass, Sasirekha Vinjamuri
SIAMJO
2002
159views more  SIAMJO 2002»
13 years 7 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 11 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand