IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v131y2006i2d10.1007_s10957-006-9141-5.html
   My bibliography  Save this article

Continuous Modular Design Problem: Analysis and Solution Algorithms

Author

Listed:
  • H. P. Benson

    (University of Florida)

Abstract

This article studies the continuous modular design (MD) problem. First, the article presents duality results for problem (MD) based upon the Wolfe duality theory for nonlinear programming. From these results, an optimality test for problem (MD) is derived that consists of solving a single, balanced transportation problem. Second, the article shows that two well-known optimization approaches, the generalized Benders decomposition and the separable programming approach of linear programming, each have the potential to solve efficiently large instances of problem (MD).

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:131:y:2006:i:2:d:10.1007_s10957-006-9141-5
    DOI: 10.1007/s10957-006-9141-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-006-9141-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-006-9141-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. SMEERS, Yves, 1974. "A monotonic Passy-like algorithm for the modular design problem," LIDAM Reprints CORE 189, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. U. Passy, 1970. "Modular Design: An Application of Structured Geometric Programming," Operations Research, INFORMS, vol. 18(3), pages 441-453, June.
    4. David H. Evans, 1963. "Modular Design---A Special Case in Nonlinear Programming," Operations Research, INFORMS, vol. 11(4), pages 637-647, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. John Chao & Matty Chen & Aileen Deng & Harold Miao & Alexandra Newman & Sophia Tseng & Candace Arai Yano, 2005. "Safeway Designs Mixed-Product Pallets to Support Just-in-Time Deliveries," Interfaces, INFORMS, vol. 35(4), pages 294-307, August.
    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.
    3. Gökalp Erbeyoğlu & Ümit Bilge, 2016. "PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem," Journal of Heuristics, Springer, vol. 22(2), pages 147-179, April.

    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:spr:joptap:v:131:y:2006:i:2:d:10.1007_s10957-006-9141-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.