Convergent Algorithms for Minimizing a Concave Function

For the problem of minimizing a concave function over a polytope a class of convergent algorithms is proposed, which is based upon a combination of the branch and bound technique with the cutting method developed earlier by H. Tuy.

[1]  Hiroshi Konno,et al.  A cutting plane algorithm for solving bilinear programs , 1976, Math. Program..

[2]  E. Balas,et al.  Maximizing a Convex Quadratic Function Subject to Linear Constraints. , 1973 .

[3]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[4]  Glenn W. Graves,et al.  AN ALGORITHM FOR NONCONVEX PROGRAMMING , 1969 .

[5]  Egon Balas,et al.  An Intersection Cut from the Dual of the Unit Hypercube , 1971, Oper. Res..

[6]  Fred W. Glover,et al.  Convexity Cuts and Cut Search , 1973, Oper. Res..

[7]  R. D. Young.  Hypercylindrically Deduced Cuts in Zero-One Integer Programs , 1971, Oper. Res..

[8]  Giorgio Gallo,et al.  Bilinear programming: An exact algorithm , 1977, Math. Program..

[9]  M. Raghavachari,et al.  On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints , 1969, Oper. Res..

[10]  Philip B. Zwart.  Global Maximization of a Convex Function with Linear Inequality Constraints , 1974, Oper. Res..

[11]  Ferenc Forgó.  Cutting plane methods for solving nonconvex programming problems , 1972, Acta Cybern..

[12]  A. Cabot.  Variations on a cutting plane method for solving concave minimization problems with linear constraints , 1974 .

[13]  O. Mangasarian.  Characterization of linear complementarity problems as linear programs , 1978 .

[14]  Willard I. Zangwill,et al.  A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..

[15]  Fred W. Glover,et al.  Polyhedral annexation in mixed integer and combinatorial programming , 1975, Math. Program..

[16]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

[17]  Antal Majthay,et al.  Quasi-concave minimization subject to linear constraints , 1974, Discret. Math..

[18]  Fred W. Glover,et al.  Concave Programming Applied to a Special Class of 0-1 Integer Programs , 1973, Oper. Res..

[19]  Philip B. Zwart,et al.  Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms , 1973, Oper. Res..

[20]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[21]  A. Victor Cabot,et al.  Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points , 1970, Oper. Res..

[22]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[23]  K. Ritter,et al.  A method for solving maximum-problems with a nonconcave quadratic objective function , 1966 .

[24]  Stephen E. Jacobsen.  Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints , 1981 .

[25]  Manuel J. Carrillo.  A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron , 1977, Math. Program..

[26]  Garth P. McCormick,et al.  Algorithmic and Computational Aspects of the Use of Optimization Methods in Engineering Design , 1973 .

[27]  Alan M. Frieze,et al.  A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..

[28]  Max Rössler.  Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion , 1971, Unternehmensforschung.

[29]  Paul F. Kough.  The Indefinite Quadratic Programming Problem , 1979, Oper. Res..

[30]  Hamdy A. Taha.  Concave minimization over a convex polyhedron , 1973 .