On the Equivalence of the Simplex Methods and a Multiplier-Alike Method for Linear Programming

Author： Chang T.S. Adachi J. Wang X. Chen T.R.

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.113, Iss.3, 2002-06, pp. : 487-512

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Equivalence of Linear Programming and Basis Pursuit

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS (ELECTRONIC), Vol. 15, Iss. 1, 2015-10 ,pp. : 735-738

John Wiley & Sons Inc

Access to resources Recommend Favorite

LPAKO: A Simplex-based Linear Programming Program

By Lim Sungmook Park Soondal

Optimization Methods and Software, Vol. 17, Iss. 4, 2002-01 ,pp. : 717-745

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Newton Method for Linear Programming

By Mangasarian O. L.

Journal of Optimization Theory and Applications, Vol. 121, Iss. 1, 2004-04 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of the Gravitational Method for Linear Programming

By Morin T.L. Prabhu N. Zhang Z.

Journal of Optimization Theory and Applications, Vol. 108, Iss. 3, 2001-03 ,pp. : 633-658

Springer Publishing Company

Access to resources Recommend Favorite

Interior-point methods for linear programming: a review

By Singh J.N. Singh D.

International Journal of Mathematical Education in Science and Technology, Vol. 33, Iss. 3, 2002-05 ,pp. : 405-423

Taylor & Francis Ltd

Access to resources Recommend Favorite