Test Problems Home
|
|
![]()
![]() |
Nonconvex quadratic programming has a quadratic objective function and linear constraints. It has numerous applications and plays an important role in many nonlinear programming methods.
| Test Problem | Description | Gams File |
|---|---|---|
| 1 | ex2.1.1.gms | |
| 2 | ex2.1.2.gms | |
| 3 | ex2.1.3.gms | |
| 4 | ex2.1.4.gms | |
| 5 | ex2.1.5.gms | |
| 6 | ex2.1.6.gms | |
| 7 | Separable concave quadratic programming problem | ex2.1.7.gms |
| 8 | Minimum concave cost trasportation problem | ex2.1.8.gms |
| 9 | Maximum clique problem stated as a nonconvex quadratic programming problem | ex2.1.9.gms |
| 10 | Separable quadratic objective function consisting of a convex part and a concave part | ex2.1.10.gms |
![]()