IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i5p788-807.html
   My bibliography  Save this article

A Simplex-Like Algorithm for the Continuous Modular Design Problem

Author

Listed:
  • Timothy L. Shaftel

    (University of Arizona, Tucson, Arizona)

  • Gerald L. Thompson

    (Carnegie-Mellon University, Pittsburgh, Pennsylvania)

Abstract

This paper derives an efficient solution procedure for solving the continuous version of the Evans modular design problem. The Kuhn-Tucker conditions are used to derive a dual problem that can be solved easily and whose dual variables indicate which equations should be tight. The technique retains a free-basic solution throughout so that fast solution routines can be employed that are quite similar to those for transportation problems. Computational experience shows that this technique works well on very large problems. We therefore have provided a solution technique for solving a nonlinear problem that has applications to various aspects of the design process.

Suggested Citation

  • Timothy L. Shaftel & Gerald L. Thompson, 1977. "A Simplex-Like Algorithm for the Continuous Modular Design Problem," Operations Research, INFORMS, vol. 25(5), pages 788-807, October.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:788-807
    DOI: 10.1287/opre.25.5.788
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.5.788
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.5.788?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. H. P. Benson, 2006. "Continuous Modular Design Problem: Analysis and Solution Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 131(2), pages 159-178, November.
    2. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:788-807. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.