For problems where you solve an LP using a version of the simplex method, you can use Vanderbei's pivot tool to help with the arithmetic. But in your solutions, record the pivots in the form the problem expects. So record your dual simplex pivots as tableaux (dictionaries are acceptable) and record your revised simplex pivots using the layout presented in the lecture slides. 2. Solve the following LP using the dual simplex method. At each iteration, choose the most negative primal variable to leave the basis. minimize 5x1 + 3x2 < -2 < 2 < -3 subject to -x1 X2 X1 + X2 -x1 X1, x2 > 0

A rancher has 120 yards of fence with which to enclose three sides of a rectangular field (the fourth side is a river and will not require fencing). Find the dimensions of the field with the largest possible area. (For the purpose of this problem, the width will be the smaller dimension (needing two sides); the length with be the longer dimension (needing one side).) length width= = yards yards What is the largest area possible for this field? area = yards-squared Enter your answers as numbers. If necessary, round to the nearest hundredths.

The correct answer is C, but I don't understand how to do the work for this problem. Can you help me solve it?