Jump to content

Math340/Solution 1

From UBC Wiki

Question 1

a. Decision variables: x1= number of yam rolls, x2= number of avocado rolls, x3= number of salmon rolls (Note: defining the variables is very important when writing down an answer).

Objective: minimize the total cost z=4*x1+3*x2+5.5*x3.

Constraints: x3≥x1,x1+x2≥4.

b. We can guess, for example: x1=2,x2=2,x3=2. For this to be feasible we need it to satisfy the two inequalities, which it does: 2≥2, and 2+2≥4.

Question 2

For Alice plays pure, Alice chooses the row with the larger minimal value, which is the first row. The value of the game is then this minimal value- 1.

Betty plays pure- Betty chooses the column with the smallest maximal value, which is the first column. The value of the game is that value which equals 4.

Question 3

a. Duality gap= Betty plays pure -Alice plays pure= 4-1=3.

b. We find Alice's optimal strategy by:


(x1,x2)(154−2)=(x1+4x2,5x1−2x2)=(v,v)

Which yields x1=35,x2=25.

c. The corresponding LP problem is:

maximizewsubject tow≤x1+4x2,w≤5x1−2x2,x1+x2=1, (note this can be replaced by x1+x2≤1)x1,x2≥0.

Question 4 (Friday, May 15)

The slack variables:

x3=5−x1−x2,x4=8−x1−2x2,x5=8−2x1−x2.


And the first dictionary:

x3=5−x1−x2x4=8−x1−2x2x5=8−2x1−x2z=4x1+5x2