edited by
967 views
1 votes
1 votes

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_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}$

  1. $x_1=2, x_2=0, \text{ and } z=-4$
  2. $x_1=2, x_2=6, \text{ and } z=-22$
  3. $x_1=0, x_2=2, \text{ and } z=-6$
  4. $x_1=6, x_2=2, \text{ and } z=-18$
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
3
Arjun asked Jan 2, 2019
4,385 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$