Skip to main content
Log in

Continuous Modular Design Problem: Analysis and Solution Algorithms

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Evans, D. H., Modular Design - A Special Case in Nonlinear Programming, Operations Research, Vol. 11, pp. 637–647, 1963.

    MATH  Google Scholar 

  2. Shaftel, T. L., and Thompson, G. L., A Simplex-Like Algorithm for the Continuous Modular Design Problem, Operations Research, Vol. 25, pp. 788–807, 1977.

    MathSciNet  MATH  Google Scholar 

  3. Hardy, G. H., Littlewood, J. E., and Polya, G., Inequalities, Cambridge University Press, Cambridge, England, 1952.

    MATH  Google Scholar 

  4. Charnes, A., and Kirby, M., Modular Design, Generalized Inverses, and Convex Programming, Operations Research, Vol. 13, pp. 836–847, 1965.

    MathSciNet  MATH  Google Scholar 

  5. Falk, J. E., An Algorithm for Separable Convex Programming under Linear Inequality Constraints, Working Paper RAC-TP-148, Research Analysis Corporation, McLean, Virginia, 1964.

    Google Scholar 

  6. Passy, U., Modular Design: An Application of Structured Geometric Programming, Operations Research, Vol. 18, pp. 441–453, 1970.

    Article  MATH  Google Scholar 

  7. Smeers, Y., A Monotonic Passy-Like Algorithm for the Modular Design Problem, Mathematical Programming, Vol. 7, pp. 46–59, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  8. Klafszky, E., Mayer, J., and Terlaky, T., A New Convergent Algorithm for the Continuous Modular Design Problem, Arabian Journal for Science and Engineering, Vol. 15, pp. 687–694, 1990.

    MathSciNet  Google Scholar 

  9. Wolfe, P., A Duality Theorem for Nonlinear Programming, Quarterly of Applied Mathematics, Vol. 19, pp. 239–244, 1961.

    MathSciNet  MATH  Google Scholar 

  10. Mangasarian, O. L., Nonlinear Programming, McGraw Hill, New York, NY, 1969.

    MATH  Google Scholar 

  11. Geoffrion, A. M., Generalized Benders Decomposition, Journal of Optimization Theory and Applications, Vol. 10, pp. 237–260, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  12. Bazaraa, M. S., Jarvis, J. J., and Sherali, H. D., Linear Programming and Network Flows, 2nd Edition, John Wiley and Sons, New York, NY, 1990.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by a Summer Research Grant from the Warrington College of Business Administration, University of Florida, Gainesville, Florida. The author is indebted to Panos Pardalos for introducing the topic to him.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benson, H.P. Continuous Modular Design Problem: Analysis and Solution Algorithms. J Optim Theory Appl 131, 159–178 (2006). https://doi.org/10.1007/s10957-006-9141-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-006-9141-5

Keywords

Navigation