Exam 4: Linear Programming

Which of these methods for the transportation problem produces an improved solution? A)stepping stone method (SSM) B)Northwest Corner Rule (NCR) C)Both SSM and NCR D)Neither SSM nor NCR

Find the point of intersection of the lines with equations 3x + 2y = 21 and 2x + 1y = 13.

Refer to the feasible region defined by the following constraints to answer the following questions : x+y\leq6 x+2y\leq8 x\geq0 y\geq0 -If the profit formula is $P = 4 x + 4 y$ what is the maximum profit?

The ordered pair (200, 400) is in the feasible region identified by the inequalities x + 2y  1500 and 4x + 3y  2200.

Use the following tableau to answer the questions: concern the following tableau for a shipping problem. -For this tableau, what is the cost for the solution given by the Northwest Corner Rule?

Graph the feasible region identified by the inequalities: 5x+1y\leq10 3x+3y\leq18 x\geq0,y\geq0

Write a resource constraint for this situation: Producing a plastic ruler (x) requires 10 grams of plastic and producing a pencil box (y) requires 30 grams of plastic. There are 2000 grams of plastic available.

Given below is the sketch of the feasible region in a linear programming problem. Which point is NOT in the feasible region?

What is the goal of a transportation problem?

Fill in the blank: Given a transportation problem, a collection of circled cells is optimal if the_________ value associated with each of the empty cells is positive.

Use the following tableau to answer the questions: concern the following tableau for a shipping problem. -In the tableau produced by the Northwest Corner Rule, what is the indicator value of cell (II, 2)?

Use the following tableau to answer the questions: concern the following tableau for a shipping problem. -What is the cost for the optimal solution to this shipping problem?

Describe the shape of the feasible region for linear programming mixture problems with two products.

Write the constraint inequalities and the profit formula for this linear programming mixture problem: The Dig-the-Pig ham shop sells regular and special ham and cheese sandwiches. The regular is made of 5 oz of meat, 0.7 oz of cheese, and requires three minutes of preparation time. The special is made of 7 oz of meat, 0.6 oz of cheese, and requires 11 minutes of preparation time. The profit on a regular sandwich is 10 cents while the profit on a special sandwich is 40 cents. If Dig-the-Pig has 350 oz of meat, 42 oz of cheese, and 330 minutes of preparation time available each lunch period, how many of each type of sandwich should they try to sell to maximize profit?

Suppose the feasible region has five corners at these points: (1, 1), (1, 7), (5, 7), (5, 5), and (4, 3). If the profit formula is P = $10x + $5y, which point maximizes the profit?

Find the maximum value of P, where P = 100x + 10y subject to the constraints: x  0; y  0 ; 2x + 5y  20; 2x + y  12

A solution for the transportation problem is optimal when the empty cells have what property?

Which of these methods for the transportation problem produces a feasible solution?

Find the graph of the inequality 2x + 6y  18.

Write a profit formula for this mixture problem: A small stereo manufacturer makes a receiver (x) and a CD player (y). Each receiver takes eight hours to assemble, one hour to test and ship, and earns a profit of $30. Each CD player takes 15 hours to assemble, two hours to test and ship, and earns a profit of $50. There are 160 hours available in the assembly department and 22 hours available in the testing and shipping department.