Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
- 1 March 1981
- journal article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 7 (1) , 1-9
- https://doi.org/10.1007/bf01442106
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the convergence of the modified tui algorithm for minimizing a concave function on a bounded convex polyhedronPublished by Springer Nature ,2005
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedronMathematical Programming, 1977
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Global Maximization of a Convex Function with Linear Inequality ConstraintsOperations Research, 1974
- Nonlinear Programming: Counterexamples to Two Global Optimization AlgorithmsOperations Research, 1973
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956