Skip to main content
Log in

Subgradient optimization applied to a discrete nonlinear problem in engineering design

  • Published:
Mathematical Programming Submit manuscript

Abstract

The particular application considered here is the design of relief-header systems, involving compressible fluid flow through tree-networks. The flowrates are specified, and the design problem involves the choice of discrete pipe sizes to minimize total cost while satisfying pressure-drop constraints, which are highly nonlinear.

The problem is solved in two stages. Firstly the problem of obtaining the optimal set of continuous pipe sizes is addressed; it turns out that a dual formulation provides and extremely rapid solution. Next, a subgradient optimization procedure is used on the dual in order to solve for the discrete pipe sizes. Networks of up to 78 paths and 205 sections, each involving 50 discrete pipe sizes, have been solved.

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. S. Agmon, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 382–392.

    MATH  MathSciNet  Google Scholar 

  2. W. B. Cheng and R. S. H. Mah, “Optimal design of pressure-relieving piping networks by discrete merging”,AIChE Journal 22 (1976) 471–476.

    Article  Google Scholar 

  3. H. Everett III, “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources”,Operations Research 11 (1963) 399–417.

    MATH  MathSciNet  Google Scholar 

  4. M.L. Fisher, W.D. Northup and J.F. Shapiro, “Using duality to solve discrete optimization problems: theory and computational experience”,Mathematical Programming Study 3 (1975) 65–94.

    MathSciNet  Google Scholar 

  5. R.C. Grinold, “Lagrangean subgradients”,Management Science 17 (1970) 185–188.

    MathSciNet  MATH  Google Scholar 

  6. M. Held and R.M. Karp, “The travelling salesman problem and minimum spanning trees: Part II”,Mathematical Programming 1 (1971) 6–25.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Held, P. Wolfe and H.D. Crowder, “Validation of subgradient optimization”,Mathematical Programming 6 (1974) 62–88.

    Article  MATH  MathSciNet  Google Scholar 

  8. T. Motzkin and I.J. Schoenberg, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 393–404.

    MATH  MathSciNet  Google Scholar 

  9. B.A. Murtagh, “An approach to the optimal design of networks”,Chemical Engineering Science 27 (1972) 1131–1141.

    Article  Google Scholar 

  10. B.A. Murtagh and M.A. Saunders, “Large-scale linearly constrained optimization”,Mathematical Programming 14 (1978) 41–72.

    Article  MATH  MathSciNet  Google Scholar 

  11. B.A. Murtagh and M.A. Saunders, “A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints”,Mathematical Programming Study 16 (1982) 84–117.

    MATH  MathSciNet  Google Scholar 

  12. B.T. Poljak, “Minimization of unsmooth functionals”,USSR Computational Mathematics and Mathematical Physics (1969) 14–29.

  13. B. Rothfarb, H. Frank, D.M. Rosenbaum, K. Steiglitz and D.J. Kleitman, “Optimal design of offshore natural-gas pipeline systems”,Operations Research 18 (1970) 992–1020.

    Article  Google Scholar 

  14. S.J. Thomson and H. Simon, “Relief system optimization”,Chemical Engineering Progress 68(5) (1972) 52–58.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murtagh, B.A., Soliman, F.I. Subgradient optimization applied to a discrete nonlinear problem in engineering design. Mathematical Programming 25, 1–12 (1983). https://doi.org/10.1007/BF02591715

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02591715

Key words

Navigation