# Degree-2 inequality

### From Glossary

Arises in mixed integer linear programming models for combinatorial programs on graphs, where each row of the matrix has 2 non-zeroes (usually 1's), as in the node packing problem.

Arises in mixed integer linear programming models for combinatorial programs on graphs, where each row of the matrix has 2 non-zeroes (usually 1's), as in the node packing problem.