Assignment 3

Due: October 20, 1999

- Problem 2.5 from the Marriott & Stuckey text.
- Solve the following problem using the two-phase Simplex algorithm,
showing the successive tableaux.
x >= 1

y >= 1

x+y >= 4

x+y <= 10

minimize 2x + yDraw a graph showing the feasible region (for the second phase only, not including any artificial variables). Which vertices did you visit at each step?

- Problem 4.1 from the Marriott & Stuckey text.
- Problem P4.2 from the Marriott & Stuckey text.
- Problem P4.3 from the Marriott & Stuckey text.
For problem P4.3 demonstrate
your absolute value rule with the following goals:
?- abs(-3,Y) ?- abs(10,Y) ?- abs(Y,5) ?- abs(Y,-5)

If there are multiple solutions have CLP(R) find them all.