Advertisement

Acta Mathematica Hungarica

, Volume 52, Issue 1–2, pp 21–36 | Cite as

A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications

  • T. V. Thieu
Article

Keywords

Concave Function Polyhedral Convex Finite Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. T. Ban, A finite algorithm for minimizing a concave function under linear constraints and its applications,Proceedings of IFIP Working Conference on Recent Advances on System Modelling and Optimization (Hanoi, January 1983).Google Scholar
  2. [2]
    R. T. Rockafellar,Convex analysis, Princeton Univ. Press, (Princeton, New Yersey, 1970).Google Scholar
  3. [3]
    T. V. Thieu, Relationship between bilinear programming and concave minimization under linear constraints,Acta Mathematica Vietnamica,2 (1980), 106–113.Google Scholar
  4. [4]
    T. V. Thieu, B. T. Tam, V. T. Ban, An outer approximation method for globally minimizing a concave function over a compact convex set,Proceedings of IFIP Working Conference on Recent Advances on System Modelling and Optimization (Hanoi, January 1983);Acta Mathematica Vietnamica,1 (1983) (to appear).Google Scholar
  5. [5]
    Ng. V. Thoai,Computational testing procedure of Tuy's decomposition method for a class of concave programming problems, Preprint. Institute of Mathematics (Hanoi, 1983).Google Scholar
  6. [6]
    Ng. V. Thoai, H. Tuy, Convergent algorithms for minimizing a concave function,Math. Oper. Res.,5 (1980), 556–566.Google Scholar
  7. [7]
    H. Tuy, Concave programming under linear constraints,Doklady Akad. Nauk,159 (1964), 32–35;Soviet Math. Transl.,5 (1964), 1437–1440.Google Scholar
  8. [8]
    H. Tuy, Minimization of a concave function over an unbounded polyhedral convex set,Acta Math. Vietnamica (to appear).Google Scholar
  9. [9]
    H. Tuy, Global maximization of a convex function over a closed, convex, not necessarily bounded set,Cahier de Math. de la Decision no 8223 CEREMADE. Univ. Paris-Dauphine 1982.Google Scholar
  10. [10]
    H. Tuy,Concave minimization under linear constraints with special structure. Preprint, Institute of Mathematics (Hanoi, 1983).Google Scholar
  11. [11]
    H. Tuy, T. V. Thieu, Ng. Q. Thai, A conical algorithm for globally minimizing a concave function over a closed convex set. Submitted toMathematics of Operations Research.Google Scholar
  12. [12]
    H. Tuy, Ng. V. Thoai, Solving the linear complementarity problem via concave programming, Method of Oper. Res.,Proceedings of the V Symposium on Operations Researchs (Köln, August 25–27, 1980). Ed. R. E. Burkard, T. Ellinger, 175–178.Google Scholar

Copyright information

© Akadémiai Kiadó 1988

Authors and Affiliations

  • T. V. Thieu
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations