Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parametric simplex algorithms for solving a special class of nonconvex minimization problems |
scientific article |
Statements
Parametric simplex algorithms for solving a special class of nonconvex minimization problems (English)
0 references
26 June 1992
0 references
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.
0 references
parametric simplex algorithm
0 references
nonconvex quadratic programs
0 references
linear fractional functions
0 references
pivoting rules
0 references
0 references
