### Homework 6

Due in class, 15 March, 2012
- Chapter 13, Problem 9 on page 324
- Use the method on page 315 to convert the formula

(x_{1} or x_{2}) and ((not x_{1}) or x_{2})
and (x_{1} or (not x_{2}))

to a linear program. Ignore the integer constraint and find a cost function
that will make the simplex algorithm find the satisfying assignment. What
other solutions might be found by other cost functions?
- Now add the clause ((not x
_{1}) or (not x_{2})) and explore
what happens.