Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography
AbstractThe 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 16 (1970)
Issue (Month): 11 (July)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Xiang Li & Asgeir Tomasgard & Paul Barton, 2012. "Decomposition strategy for the stochastic pooling problem," Journal of Global Optimization, Springer, vol. 54(4), pages 765-790, December.
- LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," CORE Discussion Papers 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.