Chapter 6.5, Problem 1P

Explanation of Solution

Duals of LP:

• Consider the linear programming problem given below:
• max z=$2x_1+x_2$
• Subject to constraints:
  • $-x_1+x_2\le 1$
  • $x_1+x_2\le 3$
  • $x_1-2x_2\le 4$
  • $x_1,x_2\ge 0$
• As the above mentioned linear programming problem is a normal max problem, therefore solve it through the tabular approach as follows:
• Construct the following table according to the given LP,

Max Z
	$(x_1\ge 0)$	$(x_2\ge 0)$
Min W	$x_1$	$x_2$
$(y_1\ge 0)$	$y_1$