Use Dual Simplex Method to solve the following problem: \(\begin{array}…

PYQ UGC NET 2018Modified — slightly modified from the official paper; see the solution

Use Dual Simplex Method to solve the following problem:

\(\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_1+x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}\)

  1. A.

    x1=2,x2=0, and z=−4x_1=2, x_2=0, \text{ and } z=-4

  2. B.

    x1=2,x2=6, and z=−22x_1=2, x_2=6, \text{ and } z=-22

  3. C.

    x1=0,x2=2, and z=−6x_1=0, x_2=2, \text{ and } z=-6

  4. D.

    x1=6,x2=2, and z=−18x_1=6, x_2=2, \text{ and } z=-18

Attempted by 11 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…