A first-orderε-approximation algorithm for linear programs and a second-order implementation

Authors:
Ana Maria A. C. Rocha;Edite M. G. P. Fernandes;João L. C. Soares
Affiliations:
Departamento de Produção e Sistemas, Universidade do Minho, Portugal;Departamento de Produção e Sistemas, Universidade do Minho, Portugal;Departamento de Matemática, Universidade de Coimbra, Portugal
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 2
Cited 0

Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents an algorithm that finds an ε-feasible solution relatively to some constraints of a linear program. The algorithm is a first-order feasible directions method with constant stepsize that attempts to find the minimizer of an exponential penalty function. When embedded with bisection search, the algorithm allows for the approximated solution of linear programs. We present applications of this framework to set-partitioning problems and report some computational results with first-order and second-order implementations.