Implementing the Simplex Method: The Initial Basis | Zendy

Robert E. Bixby | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementing the Simplex Method: The Initial Basis

Author(s) -

Robert E. Bixby

Publication year - 1992

Publication title -

informs journal on computing

Language(s) - English

Resource type - Journals

eISSN - 2326-3245

pISSN - 0899-1499

DOI - 10.1287/ijoc.4.3.267

Subject(s) - simplex , basis (linear algebra) , simplex algorithm , computer science , variable (mathematics) , series (stratigraphy) , mathematical optimization , bounded function , test (biology) , mathematics , algorithm , linear programming , combinatorics , geometry , mathematical analysis , paleontology , biology

This paper contains the first two parts of a planned series of papers on the CPLEXTM implementation of the simplex method. Part I is introductory. It gives an elementary description of the bounded-variable simplex method as well as a rather detailed discussion of some of the numerical characteristics of the netlib test problems. These problems form the basis for the computational tests in the subsequent parts. Part II contains the main results of this paper, a description of the method used by CPLEX for constructing an initial basis. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research