\ Myths and Counterexamples in Integer Programming and Combinatorial Optimization
\ Harvey J. Greenberg
Maximize
  x1
Subject To
  x2 <= 1
  x3 - 1.41421 x1 + 1.41421 x2 = 0
Bounds
  0 <= x1
  0 <= x2
  0 <= x3
General
  x1 x2 x3
SOS
  S2:: x1:1 x2:2 x3:3
End