Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems

Journal of Global Optimization

Volumn 13, Issue 3, 1998, Pages 225-240

  Konno, Hiroshi ^a   Gao, Chenggang ^a   Saitoh, Ichiroh ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b NOMURA RESEARCH INSTITUTE   (Japan)

Author keywords

Global optimization; Heuristic algorithm; Low rank concave quadratic programming problem; Rosen's cutting plane; Tabu search; Tuy's cutting plane

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; GLOBAL OPTIMIZATION; HEURISTIC METHODS; PROBLEM SOLVING;

HEURISTIC ALGORITHMS; LOW RANK CONCAVE QUADRIATIC PROGRAMMING PROBLEMS; ROSEN'S CUTTING PLANE; TABU-SEARCH; TUY'S CUTTING PLANE;

QUADRATIC PROGRAMMING;

EID: 0345439099     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008230825152     Document Type: Article

References (21)

1. Balas, E. and Burdet, C.A. (1979), Maximizing a convex quadratic function subject to linear constraints, Management Science Research Report No. 299. Carnegie-Mellon-University, Pittsburgh
2. Benson, H.P. (1994), Concave minimization: theory, applications and algorithms, in: R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht/Boston/London.
3. Cabot, A.V. and Francis, R.L. (1970), Solving nonconvex quadratic minimization problems by ranking extreme points, Operations Research 18: 82-86.
4. Chvatál, V. (1983), Linear Programming. Freeman and Co.
5. Falk, J.E. and Hoffman, K.L. (1976), A successive underestimating method for concave minimization problems, Mathematics of Operations Research 1: 251-259.
6. Floudas, C.A. and Visweswaran, V. (1995), Quadratic optimization, in Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht/Boston/London.
7. Glover, F. (1989), Tabu search 1, ORSA J. Computing 1: 190-206.
8. Glover, F. (1990), Tabu search 2, ORSA J. Computing 2: 4-32.
9. Glover, F., Taillard, E. and De Werra, D. (1993), A user's guide to search, Annals of Operations Research 41: 3-28.
10. Horst, R. and Pardalos, P.M. (1994), Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht/Boston/London.
11. Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, 2nd edn. Springer Verlag, Berlin/New York.
12. Konno, H., Thach, T.H. and Tuy, H. (1996), Optimization on Low Rank Nonconvex Structures. Kluwer Academic Publishers, Dordrecht/Boston/London.
13. Konno, H. and Saitoh, I. (1996), Cutting plane algorithm for solving low rank concave quadratic programming problems. Technical Report 96-6, Department of IE and Management, Tokyo Institute of Technology.
14. Konno, H. (1976), Maximization of a convex quadratic function under linear constraints, Mathematical Programming 11: 117-127.
15. Luenbeger, D. (1984), Introduction to Linear and Nonlinear Programming, 3rd edn. Addison-Wesley, Reading, MA.
16. Murty, K.G. (1968), Solving the fixed-charge problem by ranking extreme points, Operations Research 16: 268-279.
17. Pardalos, P.M. and Vavasis, S.A. (1991), Quadratic programming with one negative eigenvalue is NP-hard, J. Global Optimization 1: 15-22.
18. Phillips, A.T. and Rosen, J.B. (1988), A parallel algorithm for constrained concave quadratic global minimization, Mathematical Programming 42: 421-448.
19. Rockafellar, R.T. (1970), Convex Analysis. Princeton University Press, Princeton, NJ.
20. Rosen, J.B. (1983), Global minimization of a linearly constrained concave function by partition of feasible domain, Mathematics of Operations Research 8: 215-230.
21. Tuy, H. (1964), Concave programming under linear constraints, Soviet Mathematics 5: 1437-1440.