Computer Science & Engineering 505
Assignment 3

Due: October 20, 1999

  1. Problem 2.5 from the Marriott & Stuckey text.

  2. 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 + y

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

  3. Problem 4.1 from the Marriott & Stuckey text.

  4. Problem P4.2 from the Marriott & Stuckey text.

  5. 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.