A first-order E-approximation algorithm for large linear programs
This report 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...
| Autor principal: | |
|---|---|
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2000
|
| Texto completo: | http://hdl.handle.net/10316/11466 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11466 |