• On the equivalence of the simp...

Result: On the equivalence of the simplex methods and a multiplier-alike method for linear programming

Title:
On the equivalence of the simplex methods and a multiplier-alike method for linear programming
Authors:
CHANG, T. S, ADACHI, J, WANG, X, CHEN, T. R
Source:
Journal of optimization theory and applications. 113(3):487-512
Publisher Information:
New York, NY: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 9 ref
Original Material:
CRAN
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Sciences de l'information. Documentation, Information science. Documentation, Sciences de l'information et des bibliothèques. Etude d'ensemble, Library and information science. General aspects, Communication. Transfert de l'information, Communication. Information transfer, Mathematiques, Mathematics, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Sciences de l'information et de la communication, Information and communication sciences, Multiplicateur, Multiplier, Multiplicador, Méthode Lagrange, Lagrangian method, Método Lagrange, Méthode simplexe, Simplex method, Método simplejo, Programmation linéaire, Linear programming, Programación lineal, Trajectoire, Trajectory, Trayectoria
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, California, United States
Applied Mathematics Group, University of California, Davis, California, United States
ISSN:
0022-3239
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14288022
Rights:
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics

Sciences of information and communication. Documentation

FRANCIS
Accession Number:
edscal.14288022
Database:
PASCAL Archive

Further Information

In linear programming, the simplex method has been viewed for a long time as an efficient tool. Interior methods have attracted a lot of attention since they were proposed recently. It seems plausible intuitively that there is no reason why a good linear programming algorithm should not be allowed to cross the boundary of the feasible region when necessary. However, such an algorithm is seldom studied. In this paper, we will develop first a framework of a multiplier-alike algorithm for linear programming which allows its trajectory to move across the boundary of the feasible region. Second, we illustrate that such a framework has the potential to perform as well as the simplex method by showing that these methods are equivalent in a well-defined sense, even though they look so different.