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

Article

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.

Keywords

Generalized Geometric Programming Degree of difficulty Decomposition method 

References

  1. 1.
    Duffin, R.J., Peterson, E.L.: Duality theory for geometric programming. SIAM. J. Appl. Math. 14, 1307–1349 (1966) MATHCrossRefMathSciNetGoogle Scholar
  2. 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. 3.
    Duffin, R.J., Peterson, E.L.: Geometric programming with signomial. J. Optim. Theory Appl. 11(1), 3–35 (1973) MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Avriel, M., Williams, A.C.: An extension of geometric programming with applications in engineering optimization. J. Eng. Math. 5(3), 187–199 (1971) CrossRefGoogle Scholar
  5. 5.
    Nand, K.J.: Geometric programming based robot control design. Comput. Eng. 29(1–4), 631–635 (1995) Google Scholar
  6. 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) MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ecker, J.G.: Geometric programming: Methods, computations and applications. SIAM Rev. 22(3), 338–362 (1980) MATHCrossRefMathSciNetGoogle Scholar
  8. 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. 9.
    Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351–369 (1997) CrossRefMathSciNetGoogle Scholar
  10. 10.
    Wang, Y., Zhang, K., Gao, Y.: Global optimization of generalized geometric programming. Comput. Math. Appl. 48(10–11), 1505–1516 (2004) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Shushun, K.: Optimality conditions for generalized geometric programming. Math. Pract. Theory 14(2), 21–28 (1984) Google Scholar
  12. 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) MATHCrossRefMathSciNetGoogle Scholar
  13. 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) MATHCrossRefMathSciNetGoogle Scholar
  14. 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) MATHCrossRefGoogle Scholar
  15. 15.
    Islam, S., Roy, T.K.: Modified geometric programming problem and its applications. J. Appl. Math. Comput. 17(1–2), 121–144 (2005) MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Charles, B., Phillips, D.T.: In: Applied Geometric Programming [M], pp. 860–956. Wiley, New York (1976) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Shanghai University of Finance and EconomicsShanghaiChina

Personalised recommendations