Repositório Institucional da Universidade de Aveiro > Departamento de Matemática > MAT - Artigos >
 The generalized simplex method
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/4437

title: The generalized simplex method
authors: Cardoso, D.M.
Clímaco, J.C.N.
keywords: Algorithms
Large scale systems
Linear programming
issue date: 1992
publisher: Elsevier
abstract: A method for solving linear programs which corresponds to a generalization of the simplex algorithm is introduced. This method makes feasible movements between faces of arbitrary dimension of a polytope and converges to an optimal face. The approach starts at a face of a high dimension, which is easy to determine, and systematically moves from one face to another such that, in general, the dimension of the current face decreases in each iteration. © 1992.
URI: http://hdl.handle.net/10773/4437
ISSN: 0167-6377
publisher version/DOI: http://www.sciencedirect.com/science/article/pii/016763779290094J
source: Operations Research Letters
appears in collectionsMAT - Artigos

files in this item

file description sizeformat
CardosoClimaco92.pdfPrinted Version349 kBAdobe PDFview/open
Restrict Access. You can Request a copy!

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2