Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915): Difference between revisions

A parametric simplex algorithm is given to minimize the sum of a linear function and the product of two linear functions. This approach extends to a class of nonconvex quadratic programs, and also to minimizing the sum of two linear fractional functions. Computational results are given, and pivoting rules are given for degenerate cases.