Sciweavers

383 search results - page 2 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 5 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
MP
1998
105views more  MP 1998»
13 years 5 months ago
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
Gert A. Tijssen, Gerard Sierksma
SC
1994
ACM
13 years 10 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
CCE
2005
13 years 6 months ago
Phenotype phase plane analysis using interior point methods
Phenotype phase plane analysis is a linear optimization procedure which can be used to study the value of the objective function (a desired phenotype) as two variables (external s...
Steven L. Bell, Bernhard O. Palsson
EOR
2008
103views more  EOR 2008»
13 years 6 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...