Sciweavers

103 search results - page 5 / 21
» siamjo 2008
Sort
View
SIAMJO
2002
96views more  SIAMJO 2002»
13 years 9 months ago
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bou...
Y. Q. Bai, Mohamed El Ghami, Cees Roos
SIAMJO
2008
95views more  SIAMJO 2008»
13 years 9 months ago
Geometric Duality in Multiple Objective Linear Programming
We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can...
Frank Heyde, Andreas Löhne
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 9 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
SIAMJO
2002
105views more  SIAMJO 2002»
13 years 9 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
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 9 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright