## [MAGP]

Mathematical Programming

##### [magp-lp][1]: Linear programming

Linear programming with scalar variables.

##### [magp-lp][2]: Linear programming (vector)

Linear programming with vector variables.

##### [magp-lp][3]: Linear programming (affine)

Linear programming with scalar variables and affine functions.

##### [magp-lp][4]: Linear programming (fraction)

Linear programming with a fractional objective of affine functions.

##### [magp-lp][5]: Linear programming (norm)

Linear programming with norm-l1 function.

##### [magp-lp][6]: Linear programming (norm)

Linear programming with norm-infinity function.

##### [magp-lp][7]: Linear programming (inner product)

Linear programming with inner product of LP problem.

##### [magp-lp][8]: Linear programming (fraction)

Linear programming with a fractional constraint.

##### [magp-lp][9]: Linear programming (exponent)

Linear programming with an exponential constraint.

##### [magp-qp][1]: Quadratic programming

Quadratic programming with scalar variables.

##### [magp-qp][2]: Quadratic programming (constraint)

Quadratic programming with equality constraints.

##### [magp-qp][3]: Quadratic programming (constraint)

Quadratic programming with inequality constraints.

##### [magp-qp][4]: Quadratic programming (constraints)

Quadratic programming with both equality and inequality constraints.

##### [magp-cp][1]: Conic programming

Conic programming with a linear problem.

##### [magp-cp][2]: Conic programming (constraints)

Conic programming with a model of quadratically constrained quadratic problem.

##### [magp-cp][3]: Conic programming (constraint)

Conic programming with general models.

##### [magp-gp][1]: Geometric programming (simple)

Geometric programming with a simple model.

##### [magp-gp][2]: Geometric programming (constraint)

Geometric programming with positive constraints of variables.

##### [magp-gp][3]: Geometric programming (constraint)

Geometric programming with GP constraints.

##### [magp-gp][4]: Geometric programming (objectives)

Geometric programming with objective functions as a list.

##### [magp-sdp][1]: Semidefinite programming

Semidefinite programming with a linear problem.

##### [magp-sdp][2]: Semidefinite programming (general)

Semidefinite programming with general models.

##### [magp-sdp][3]: Semidefinite programming (nonlinear)

Semidefinite programming with nonlinear functions but convexity.

##### [magp-stnp][1]: Structure Nonconvex Programming

Structure Nonconvex Programming with an absolute value function.

##### [magp-stnp][2]: Structure Nonconvex Programming (minimax)

Structure Nonconvex Programming by minimizing the maximum of a list functions.

##### [magp-stnp][3]: Structure Nonconvex Programming (norm)

Structure Nonconvex Programming with norm-l2.

##### [magp-stnp][4]: Structure Nonconvex Programming (norm)

Structure Nonconvex Programming with a norm-1 objective and linear constraints.

##### [magp-stnp][5]: Structure Nonconvex Programming (integer)

Structure Nonconvex Programming with integer variables.