A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 13 (1) , 69-80
- https://doi.org/10.1007/bf01584324
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Quasi-concave minimization subject to linear constraintsDiscrete Mathematics, 1974
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- Generating All the Faces of a PolyhedronSIAM Journal on Applied Mathematics, 1974
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- Convexity Cuts and Cut SearchOperations Research, 1973
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965
- Decomposition Principle for Linear ProgramsOperations Research, 1960