Question: Questions # 17 to # 20 are based on solving the following Linear Programming problem by the Two-Phase Simplex algorithm: max z = : =

Questions # 17 to # 20 are based on solving the following Linear Programming problem by the Two-Phase Simplex algorithm: max z = : = 3x1 + x2 St. xz - X S-1 2x1 - x2 = 2 --X1 - X2 S-3 X1 X2 20 17. In step 1 of Phase I, which one is the entering variable? a. No entering variable b. Xo c. X d. X2 X 8. X's h. None of the above 18. In step 1 of Phase I, which one is the leaving variable? Xo a. b. X c. X2 d. xs e. x f. X, or Xs B. Xs h. None of the above a. 19. At the end of phase I, what is the value of Xo? 0 b. - 1 c. 1 d. 2.5 e 0.5 f. 3 h. None of the above 20. What is the optimal objective z value? b. 5 c. 7 d. 13 e. 14 f. Infeasible g. Unbounded h. None of the above

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

In the rest of this chapter, we lead the reader through the formulation of several more complicated linear programming models. The most important step in formulating an LP model is the proper choice...

Q.1 (a) Discuss Linear Programming its importance, utility along with its elements. (5) (b) Four products are processed successively on two machines. The manufacturing times in hours per unit of each...

+ Problem 6. (12 marks in total) Consider the following linear programming problem: Max Z=3x, +5x2 +6X3 s.t. 2x, + x2 + x2 54 X, +2x2 + x2 54 X, +x2 + 2x, 54 X, + x2 + x2 53 X1, X2, X, 20 a. (1 mark)...

3 Use the Big M method and the two-phase method to nd the optimal solution to the following LP: max z 5x1 x2 s.t. 2x1 x2 6 s.t. x1 x2 4 s.t. x1 2x2 5 x1, x2 0 4 Use the simplex algorithm to nd the...

20) Solve the following linear problem graphically: max s.t. 21) Solve the following linear problem graphically: max s.t. 2X1 + X2 2X1 + X 10 X 4 X 5 X1, X 0 max s.t. -X1 - X -2x1 + 2x 6 3X1 + X...

The University of Sydney School of Mathematics and Statistics Assignment MATH2070/2970: Optimisation and Financial Mathematics Semester 2, 2017 Web Page: http://www.maths.usyd.edu.au/u/IM/MATH2070/...

23) Determine using the Simplex algorithm the optimal solution to the following linear programming problem: min s.t. min s.t. -5x12x2 3x3 - X4 X1- 2x2 - 2x3 + 2x4 4 -X1 + X2 + X3 X4 6 X1, X2, X3,...

Q1: Solve the following problem graphically: Maximize Z=3x=9 Subject to the constraints: x+3y = 60 x+y2 10 XS where xy20 (25 Marks) Q2: The below table defines the activities within a small project....

The December 31, 19xB trial balance of the Cristiano Company showed: Sales $4,000,500 Sales Return & Allowances $25,200 Purchases (Net) 2,400,000 Transportation-in 32,000 Direct Labor 3,204,000...

What are covenants not to compete? What is the standard used to judge their legality?

AP10.8 The Manutec robot has large inertia and arm length resulting in a challenging control problem, as shown in Figure AP10.8(a). The block diagram model of the system is shown in Figure AP10.8(b)....

Plz solve both i and ii (i) Explain concisely what is meant by the term "four-wave mixing" (FWM) and how it influences the operation of a dense wavelength division multiplexing (DWDM) system and how...