An efficient solution method for rank two quasiconcave minimization problems

References

• Forgo , F. 1975 . The solution of a special quadratic problem . Szigma , 1 : 53 – 59 . in Hungarian
   Google Scholar
• Gabasov , R. and Kirillova , F.M. 1980 . Linear programming methods, Part 3 (Special problems) Minsk in Russian
   Google Scholar
• Henderson , J.M. and Quandt , R.E. 1971 . Microeconomic Theory , New York : McGraw-Hill .
   Google Scholar
• Horst , R. , Thoai , N.V. and de Vries , J. 1988 . On finding new vertices and redundant constraints in cutting plane algorithms for global optimization . Operations Research Letters , 7 : 85 – 90 .
   Web of Science ®Google Scholar
• Horst , R. and Tuy , H. 1990 . “ Global Optimization (deterministic approaches) ” . Berlin, New York : Springer-Verlag .
   Google Scholar
• Konno , H. and Inori , M. 1988 . Bond Portfolio optimization by bilinear fractional programming . J. Oper. Res. Soc. Japan , 32 : 143 – 158 .
   Web of Science ®Google Scholar
• Konno , H. and Kuno , T. 1989 . “ Linear multiplicative programming ” . Tokyo Institute of Technology . IHSS Report 89–13, Institue of Human and Social Sciences
   Google Scholar
• Konno , H. , Yajima , Y. and Matsui , T. 1990 . Parametric simplex algorithms for solving a special class of nonconvex minimization problems , Tokyo Institute of Technology . IHSS Report 90–16, Institute of Human and social Sciences
   Google Scholar
• Maling , K. , Mueller , S.H. and Heller , W.R. . On finding most optimal rectangular package plans . proceedings of the 19th Design Automation Conference . pp. 663 – 670 .
   Google Scholar
• Muu , L.D. 1990 . Minimizing the sum of a convex function and the product of two affine functions over a convex set , Hanoi : Institute of Mathematics . Preprint
   Google Scholar
• Pardalos , P.M. 1988 . “ Polynomial time algorithms for some classes of constrained nonconvex quadratic problems ” . Pennsylvania State University . Preprint
   Google Scholar
• Rockafellar , R.T. 1970 . “ Convex Analysis ” . Princeton University Press .
   Google Scholar
• Thach , P.T. and Burkard , R. 1989 . “ Reverse convex programs dealing with the product of two linear functions ” . Graz Technical University . Preprint, Institute of Mathematics
   Google Scholar
• Tuy , H. 1991 . Polyhedral annexation, dualization and dimension reduction technique in global optimization . Journal of Global Optimization , 1 : 229 – 244 .
   Google Scholar
• Yajima , Y. and Konno , H. 1990 . Efficient algorithms for solving rank two and rank three bilinear programming problems , Tokyo Institute of Technology . IHSS Report 90–21, Institute of Human and Social Sciences
   Google Scholar