\ Myths and Counterexamples in Integer Programming and Combinatorial Optimization
\ Harvey J. Greenberg
Maximize
  21 x1 + 11 x2
Subject To
  7 x1 + 4 x2 <= 13
Bounds
  0 <= x1
  0 <= x2
General
  x1 x2
End