An efficient solution method for rank two quasiconcave minimization problems
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 24 (1-2) , 43-56
- https://doi.org/10.1080/02331939208843778
Abstract
The technique of dimension reduction earlier developed by the first author is applied to the class of nonconvex minimization problems having the so called rank two property. This class includes in particular the problem of minimizing the product of two affine functions over a polytope. An efficient method for solving this class of problems is presented. Also some results of computational experiments with this method are discussedKeywords
This publication has 6 references indexed in Scilit:
- Polyhedral annexaton, dualization and dimension reduction technique in global optimizationJournal of Global Optimization, 1991
- Global OptimizationPublished by Springer Nature ,1990
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problemsOptimization, 1990
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimizationOperations Research Letters, 1988
- On finding Most Optimal Rectangular Package PlansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970