Abstract
It is shown that parametric linear programming algorithms work efficiently for a class of nonconvex quadratic programming problems called generalized linear multiplicative programming problems, whose objective function is the sum of a linear function and a product of two linear functions. Also, it is shown that the global minimum of the sum of the two linear fractional functions over a polytope can be obtained by a similar algorithm. Our numerical experiments reveal that these problems can be solved in much the same computational time as that of solving associated linear programs. Furthermore, we will show that the same approach can be extended to a more general class of nonconvex quadratic programming problems.
Similar content being viewed by others
References
Aneja, Y. P., Aggarwal, V., and Nair, K. P. K. (1984), On a Class of Quadratic Programming, EJOR 18, 62–70.
Bector, C. R. and Dahl, M. (1974), Simplex Type Finite Iteration Technique and Reality for a Special Type of Pseudo-Concave Quadratic Functions, Cahiers du Centre d'Etudes de Recherche Operationnelle 16, 207–222.
Chvátal, V. (1983), Linear Programming, W. H. Freeman and Company.
Cottle, R. W. and Dantzig, G. B. (1968), Complementary Pivot Theory of Mathematical Programing, Linear Algebra and Its Applications 1, 103–125.
Dantzig, G. B. (1963), Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey.
Henderson, J. M. and Quandt, R. E. (1971), Microeconomics, McGraw-Hill, New York.
Klafszky, E. and Terlaky, T. (1989), Some Generalizations of the Criss-Cross Method for Quadratic Programming, Combinatorica 9, 189–198.
Konno, H. and Inori, M. (1988), Bond Portfolio Optimization by Bilinear Fractional Programming, J. Oper. Res. Soc. of Japan 32, 143–158.
Konno, H. and Kuno, T. (1989), Generalized Linear Multiplicative and Fractional Programming, IHSS Report 89-14, Institute of Human and Social Sciences, Tokyo Institute of Technology.
Konno, H. and Kuno, T. (1989), Linear Multiplicative Programming, IHSS Report 89-13, Institute of Human and Social Sciences, Tokyo Institute of Technology.
Lemke, C. E. (1965), Bimatrix Equilibrium Points and Mathematical Programming, Management Science 11, 681–689.
Pardalos, P. M. and Rosen, J. B. (1987), Global Optimization, Springer-Verlag, Berlin.
Schaible, S. (1974), Maximization of Quasiconcave Quotients and Products of Finitely Many Functionals, Cahiers du Centre d'Etudes de Recherche Operationnelle 16, 45–53.
Swarup, K. (1966), Programming with Indefinite Quadratic Function with Linear Constraints, Cahier du Centre d'Etudes de Rescherche Operationnelle 8, 133–136.
Terlaky, T. (1985), A Convergent Criss-Cross Method, Math. Oper. und Stat. ser. Optimization 16, 683–690.
Terlaky, T. (1987), A Finite Criss-Cross Method for Oriented Matroids, J. Combin. Theory. Ser. B 42, 319–327.
Wang, Z. (1987), A Conformal Elimination Free Algorithm for Oriented Matroid Programming, Chinese Annals of Mathematics 8 B 1.
Zionts, S. (1969), The Criss-Cross Method for Solving Linear Programming Problems, Management Science 15, 426–445.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Konno, H., Yajima, Y. & Matsui, T. Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J Glob Optim 1, 65–81 (1991). https://doi.org/10.1007/BF00120666
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00120666