Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Arthur M. Geoffrion

    (University of California, Los Angeles)

Registered author(s):

    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.

    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: http://dx.doi.org/10.1287/mnsc.16.11.676
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 16 (1970)
    Issue (Month): 11 (July)
    Pages: 676-691

    as in new window
    Handle: RePEc:inm:ormnsc:v:16:y:1970:i:11:p:676-691

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

    Related research

    Keywords:

    References

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

    Citations

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

    Cited by:
    1. 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.
    2. LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," CORE Discussion Papers 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Lists

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

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1970:i:11:p:676-691. 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.