Eliminating columns in the simplex method for linear programming

Eliminating columns in the simplex method for linear programming [electronic resource]

In this paper we pose and answer two questions about solutions of the linear complementarity problem (LCP). The first question is concerned with the conditions on a square matrix M which guarantee that for every vector q, the solutions of LCP (q,M) are identical to the Karush-Kuhn-Tucker points of t...

Full description

Saved in:
Bibliographic Details
Online Access: Online Access
Corporate Authors: Stanford University. Systems Optimization Laboratory (Researcher), United States. Department of Energy. Oakland Operations Office (Researcher)
Format: Government Document Electronic eBook
Language:English
Published: Oakland, Calif. : Oak Ridge, Tenn. : United States. Dept. of Energy. Oakland Operations Office ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1987.
Subjects:
Quasilinear Problems.
Matrices.
Analytical Solution.
General And Miscellaneous//mathematics, Computing, And Information Science.

Internet

Online Access

Online

Holdings details from Online
Call Number: E 1.99:sol-87-14
E 1.99:sol-87-14 Available

Similar Items