Cutting plane methods

Part of the Lecture Notes in Computer Science book series (LNCS, volume 268)


Auxiliary Problem Feasible Domain Linear Inequality Constraint Concave Minimization Auxiliary Linear Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BALI78]
    Bali, S. and Jacobsen, S. On the convergence of the modified Tuy algorithm for minimizing a concave function on a bounded convex polyhedron. Proceedings of the 8th IFIP Conf. on Optim. Techniques, Würzburg, Optimization Techniques (ed. J. Stoer), Springer-Verlag (1978), 59–66.Google Scholar
  2. [BULA82]
    Bulatov, V.P. and Kasinskaya, L.I. Some methods of concave minimization on a convex polyhedron and their applications. (Russian). Methods of optimization and their applications Nauka Sibirsk, Otdel. Novosibirsk. (1982), 71–80.Google Scholar
  3. [FRAN56]
    Frank, M. and Wolfe, P. An algorithm for quadratic programming. Naval Res. Log. Quarterly 3 (1956), 95–110.Google Scholar
  4. [GLOV73A]
    Glover, F. Convexity cuts and cuts search. Oper. Res. 21 (1973), 123–134.Google Scholar
  5. [GLOV73B]
    Glover, F. and Klingman, D. Concave programming applied to a special class of 0–1 integer programs. Oper. Res. 21 (1973), 135–140.Google Scholar
  6. [INDI84]
    Indihar, S. Maximization of a convex function on a bounded polytope. IV Conference on Applied Math. (Split 1984), 131–138.Google Scholar
  7. [JACO81]
    Jacobsen, S.E. Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints. Appl. Math. Opti. 7 (1981), 1–9.CrossRefGoogle Scholar
  8. [KELL60]
    Kelly, J.E. The cutting plane method for solving convex programs. J. Soc. Industr. Appl. Math. 8 (1960), 703–712.CrossRefGoogle Scholar
  9. [KRYN79]
    Krynski, S.L. Minimization of a concave function under linear constraints (modification of Tuy's method). Survey of Mathematical Programming (Proc. Ninth International Progr. Sympos. Budapest 1976) Vol. 1, North Holland, Amsterdam (1979), 479–493.Google Scholar
  10. [MUKH82]
    Mukhamediev, B.M. Approximate methods for solving concave programming problems. USSR Comput. Maths. Math. Phys. 22 (1982), 238–245.CrossRefGoogle Scholar
  11. [RITT65]
    Ritter, K. Stationary points of quadratic maximum problems. Z. Wahrscheinlichkeitstheorie verw. Geb. 4 (1965), 149–158.CrossRefGoogle Scholar
  12. [RITT66]
    Ritter, K. A method for solving maximum problems with a nonconcave quadratic objective function. Z. Wahrscheinlichkeitstheorie verw. Geb. 4 (1966), 340–351.CrossRefGoogle Scholar
  13. [THOA80]
    Thoai, Ng.V. and Tuy, H. Convergent algorithms for minimizing a concave function. Math. of Oper. Research Vol.5 (1980), 556–566.Google Scholar
  14. [TUY64]
    Tuy, H. Concave programming under linear constraints. Dokl. Akad. Nauk SSR (1964), 159, 32–35.Google Scholar
  15. [TUY83]
    Tuy, H. On outer approximation methods for solving concave minimization problems. Report No. 108 (1983), Forschungsschwerpunkt Dynamisch Systeme Universität Bremen, West Germany.Google Scholar
  16. [TUY85]
    Tuy, H., Thieu, T.V., and Thai, Ng.Q. A conical algorithm for globally minimizing a concave function over a closed convex set. Math. of Oper. Research, Vol. 10, No. 3 (1985), 498–514.Google Scholar
  17. [ZWAR73]
    Zwart, P.B. Nonlinear Programming: Counterexamples to two global optimization algorithms. Oper. Reser. 21 (1973), 1260–1266.Google Scholar
  18. [ZWAR74]
    Zwart, P.B. Global maximization of a convex function with linear inequality constraints. Oper. Reser. 22 (1974), 602–609.Google Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations