Advertisement

Journal of Global Optimization

, Volume 1, Issue 3, pp 229–244 | Cite as

Polyhedral annexaton, dualization and dimension reduction technique in global optimization

  • Hoang Tuy
Article

Abstract

We demonstrate how the size of certain global optimization problems can substantially be reduced by using dualization and polyhedral annexation techniques. The results are applied to develop efficient algorithms for solving concave minimization problems with a low degree of nonlinearity. This class includes in particular nonconvex optimization problems involving products or quotients of affine functions in the objective function.

Key words

Polyhedral annexation dualization dimension reduction technique linearly constrained quasiconcave minimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aneja, Y. P., V.Aggarwal, and K. P. K.Nair (1984), On a class of quadratic programming, EJOR 18, 62–70.Google Scholar
  2. 2.
    Henderson, J. M. and R. E.Quandt (1871), Microeconomics, McGraw-Hill, New York.Google Scholar
  3. 3.
    Horst, R. and N. V.Thoai (1989), Modification, implementation and comparison of three algorithms for globally solving linearly constraned concave minimization problems. Computing 42, 271–289.Google Scholar
  4. 4.
    Horst, R., N. V.Thoai, and J.deVries (1988), On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Operations Research Letters 7, 85–90.Google Scholar
  5. 5.
    Horst, R. and H.Tuy (1990), Global Optimization: Deterministic Approaches, Springer-Verlag, Berlin-New York.Google Scholar
  6. 6.
    Konno, H. and T. Kuno (1989), Linear multiplicative programming, IHSS Report 89-13, Institute of Human and Social Sciences, Tokyo Institute of Technology.Google Scholar
  7. 7.
    Konno, H. and T. Kuno (1989), Generalized linear multiplicative and fractional programming, IHSS Report 89-14, Institute of Human and Social Sciences, Tokyo Institute of Technology.Google Scholar
  8. 8.
    Konno, H., Y. Yajima, and T. Matsui (1990), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, IHSS Report 90-16, Institute of Human and Social Sciences, Tokyo Institute of Technology.Google Scholar
  9. 9.
    Konno, H. and M.Inori (1988), Bond portfolio optimization by bilinear fractional programming, J. Oper. Res. Soc. Japan 32, 143–158.Google Scholar
  10. 10.
    Pardalos, P. M. (1988), On the global minimization of the product of two linear functions over a polytope, preprint, Pennsylvania State University, 1988.Google Scholar
  11. 11.
    Rockafellar R. T. (1970), Convex Analysis, Princeton University Press.Google Scholar
  12. 12.
    Swarup, K. (1966), Programming with indefinite quadratic function with linear constraints, Cahier du Centre d'Etudes de Recherche Operationnelle 9, 133–136.Google Scholar
  13. 13.
    Thach P. T. and R. Burkard (1989), Reverse convex programs dealing with the product of two linear functions, preprint, Graz Institute of Mathematics, Graz University of Technology.Google Scholar
  14. 14.
    Tuy, H. (1964), Concave programming under linear constrainst, Soviet Math. Doklady 5, 1437–1440.Google Scholar
  15. 15.
    Tuy H. (1990), On polyhedral annexation method for concave minimization, in Functional Analysis, Optimization, and Mathematical Economics, ed. Lev J. Leifman, Oxford University Press 248–260.Google Scholar
  16. 16.
    Tuy, H. (1991), On nonconvex optimization problems with separated nonconvex variables, Journal of Global Optimization (to appear).Google Scholar
  17. 17.
    Tuy, H. and R.Horst (1990), The geometric complementarity problem and transcending stationarity in global optimization, preprint, Institute of Mathematics, Hanoi, 1990. (submitted).Google Scholar
  18. 18.
    Gabasov, R. and F. M. Kirillova (1980), Linear Programming Methods, Part 3 (Special problems), Minsk (in Russian).Google Scholar
  19. 19.
    Tuy, H. (1991), The complementary convex structure in global optimization. Proceedings, Conference on Recent Advances in Global Optimization, Princeton (to appear).Google Scholar

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations