Skip to main content
SpringerLink
Log in

A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper, a general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty is proposed. It shows that under certain assumptions the primal problem can be transformed and decomposed into several subproblems which are easy to solve, and furthermore we verify that through solving these subproblems we can obtain the optimal value and solutions of the primal problem which are global solutions. At last, some examples are given to vindicate our conclusions.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Duffin, R.J., Peterson, E.L.: Duality theory for geometric programming. SIAM. J. Appl. Math. 14, 1307–1349 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  2. Duffin, R.J., Peterson, E.L., Zener, C.: In: Geometric Programming Theory and Applications [M], pp. 115–140. Wiley, New York (1967)

    Google Scholar 

  3. Duffin, R.J., Peterson, E.L.: Geometric programming with signomial. J. Optim. Theory Appl. 11(1), 3–35 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  4. Avriel, M., Williams, A.C.: An extension of geometric programming with applications in engineering optimization. J. Eng. Math. 5(3), 187–199 (1971)

    Article  Google Scholar 

  5. Nand, K.J.: Geometric programming based robot control design. Comput. Eng. 29(1–4), 631–635 (1995)

    Google Scholar 

  6. Jefferson, T.R., Scott, C.H.: Generalized geometric programming applied to problems of optimal control: I. Theory. J. Optim. Theory Appl. 26(1), 117–129 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ecker, J.G.: Geometric programming: Methods, computations and applications. SIAM Rev. 22(3), 338–362 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kortanek, K.O., Xiaojie, X., Yinyu, Y.: An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Program. 76, 155–181 (1996)

    Google Scholar 

  9. Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351–369 (1997)

    Article  MathSciNet  Google Scholar 

  10. Wang, Y., Zhang, K., Gao, Y.: Global optimization of generalized geometric programming. Comput. Math. Appl. 48(10–11), 1505–1516 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Shushun, K.: Optimality conditions for generalized geometric programming. Math. Pract. Theory 14(2), 21–28 (1984)

    Google Scholar 

  12. Alejandre, J.L., Allueva, A., Gonzalez, J.M.: A general alternative procedure for solving negative degree of difficulty problems in geometric programming. Comput. Optim. Appl. 27, 83–93 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sinha, S.B., Biswas, A., Biswal, M.P.: Geometric programming problems with negative degree of difficulty. Eur. J. Oper. Res. 28, 101–103 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Bricker, D.L., Choi, J.C., Rajpopal, J.: On geometric programming problems having negative degrees of difficulty. Eur. J. Oper. Res. 68, 427–430 (1993)

    Article  MATH  Google Scholar 

  15. Islam, S., Roy, T.K.: Modified geometric programming problem and its applications. J. Appl. Math. Comput. 17(1–2), 121–144 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Charles, B., Phillips, D.T.: In: Applied Geometric Programming [M], pp. 860–956. Wiley, New York (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai University of Finance and Economics, Shanghai, 200433, China

    Wang Yanjun, Li Tao & Liang Zhian

Authors
  1. Wang Yanjun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Zhian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wang Yanjun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yanjun, W., Tao, L. & Zhian, L. A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty. Comput Optim Appl 44, 139–158 (2009). https://doi.org/10.1007/s10589-007-9148-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9148-3

Keywords

Search

Navigation