Contents
 1 Introduction
 2 Variations
 3 A Linear Program (examp-lp)
 4 A Integer Linear Program (examp-ip)
 5 A 0-1 Integer Program (examp-ip01)
 6 An LP-relaxation of the 0-1 Program (examp-ip01r)
 7 A Quadratic Convex Program (examp-qp)
 8 A 0-1-Quadratic Program (examp-qp01)
 9 Second-Order Cone (socp1)
 10 Rotated second-order Cone (socp2)
 11 A NQCP model (bilinear)
 12 Largest Empty Rectangle (iNCQP) (quadrect)
 13 A NLP (non-linear) Model (chain)
 14 Discrete Dynamic System (foxrabbit)
 15 A Simple Permutation Model (examp-tsp)
 16 Capacitated Vehicle Routing Problem (examp-cvrp)
 17 Binpacking (examp-binpack)
  17.1 Summary of the permutation problems as implemented in LPL
 18 Additional Variable Types
  18.1 Semi-continuous variable (semi-1)
  18.2 Semi-integer variable (semi-2)
  18.3 A multiple choice variable (mchoice-3)
 19 Additional Constraint Types
  19.1 Sos1 Constraint (sos-1)
  19.2 Sos2 Constraint (sos-2)
  19.3 MPEC Model Type (compl-3)
 20 Conclusion
 References