A finite algorithm for concave minimization over a polyhedron
- 1 February 1985
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 32 (1) , 165-177
- https://doi.org/10.1002/nav.3800320119
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cutsMathematical Programming, 1980
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedronMathematical Programming, 1977
- Bilinear programming: An exact algorithmMathematical Programming, 1977
- A cutting plane algorithm for the bilinear programming problemNaval Research Logistics Quarterly, 1977
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976
- The bilinear programming problemNaval Research Logistics Quarterly, 1976
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- Concave minimization over a convex polyhedronNaval Research Logistics Quarterly, 1973