Question #4

A maximization linear programming problem has been solved by the simplex method:

	X1	X2	X3	S1	S2	S3	R.H.S
S1	4	1	0	1	0	2	8
S2	2	2	0	0	1	1	10
X3	3	1	1	0	0	4	9
Z	-5	-3	0	0	0	2	40

28) Which one of the following correctly indicates the combination of entering and leaving variables?

A. X1 and S1 B. S3 and S2 C. X1 and X3 D. X2 and S2

29) What are values of Decision variables (X1, X2, X3)?

A. (0, 0, 8) B. (8, 10, 9) C. (0, 0, 9) D. (8, 10, 0)

30) What are values of slack variables (S1, S2, S3)?

A. (8, 10, 0) B. (0, 10, 9) C. (8, 10, 9) D. (0, 0, 2)

31) What is value of the objective function (Z)?

A. 8 B. 40 C. 10 D. 2

32) The following are constraints which have had slack variables added. X1 + 2 X2 + S1 = 20 and 2X1 + 3 X2 + S2 = 36. If X1 = 2 and X2 = 4, what are the values for S1and S2?

A. S1 = 10, S2 = 20 B. S1= 14, S2 = 26 C. S1=8, S2=16 D. S1=0, S2=0

33) Solved L.P. problem indicated that the optimal solution was X1 =10 and X2=20. One of the constraints was 4 X1 +2X2 80. This constraint has.

A. Surplus greater than zero B. Slack greater than zero C. Surplus equal to zero D. Slack equal to zero

34) Alternative solutions exist of an LP model when

A. One of the constraints is redundant B. Two constraints are parallel C. Objective function equation is parallel to one of the constraints D. All of the above