COMPACT FORMULATION

Compact formulation - In integer programming , thisrefers to having a polynomial number of constraints. For example,look at the travelling salesmanformulations . The linear form has an exponential number of"subtour elimination consgtraints," so it is not compact. The quadraticassignment formulation is compact.