Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography

Arthur M. Geoffrion
Additional contact information
Arthur M. Geoffrion: University of California, Los Angeles

Management Science, 1970, vol. 16, issue 11, 676-691

Abstract: The problem manipulations and solution strategies of Part I of this paper are now further illustrated by combining them in various ways to yield several known algorithms. The main object is not an exposition of these algorithms, although this is certainly important; rather, we wish to focus on the principal patterns in which manipulations and strategies can be assembled. These patterns constitute the real common denominators in the literature on large-scale programming. See Table 2 in Part I.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.11.676 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1970:i:11:p:676-691

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().