Advanced Search
MyIDEAS: Login to save this article or follow this journal

The Elimination form of the Inverse and its Application to Linear Programming


Author Info

  • Harry M. Markowitz

    (The RAND Corporation)


It is common for matrices in industrial applications of linear programming to have a large proportion of zero coefficients. While every item (raw material, intermediate material, end item, equipment item) in, say, a petroleum refinery may be indirectly related to every other, any particular process uses few of these. Thus the matrix describing petroleum technology has a small percentage of non-zeros. If spacial or temporal distinctions are introduced into the model the percentage of non-zeros generally falls further. The present paper discusses a form of inverse which is especially convenient to obtain and use for matrices with a high percentage of zeros. The application of this form of inverse in linear programming is also discussed.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Download Restriction: no

Bibliographic Info

Article provided by INFORMS in its journal Management Science.

Volume (Year): 3 (1957)
Issue (Month): 3 (April)
Pages: 255-269

as in new window
Handle: RePEc:inm:ormnsc:v:3:y:1957:i:3:p:255-269

Contact details of provider:
Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
Phone: +1-443-757-3500
Fax: 443-757-3515
Web page:
More information through EDIRC

Related research



No references listed on IDEAS
You can help add them by filling out this form.


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Dobrzyński, Michał & Plata, Jagoda, 2010. "Fill-ins number reducing direct solver designed for FIT-type matrix," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(8), pages 1684-1693.
  2. Miles Lubin & J. Hall & Cosmin Petra & Mihai Anitescu, 2013. "Parallel distributed-memory simplex for large-scale stochastic LP problems," Computational Optimization and Applications, Springer, vol. 55(3), pages 571-596, July.
  3. LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," CORE Discussion Papers 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. Gass, Saul I., 1997. "The Washington operations research connection: the rest of the story," Socio-Economic Planning Sciences, Elsevier, vol. 31(4), pages 245-255, December.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:3:y:1957:i:3:p:255-269. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.