In the simplex method, a basic solution is infeasible if one of ...

[j.rubin]

In the simplex method, a basic solution is infeasible if one of the slack variables is negative.
 
  A) True B) False

Question 2

A furniture company makes two different types of lamp stand. Each lamp stand A requires 16 minutes for sanding, 48 minutes for assembly, and 6 minutes for packaging.
 
  Each lamp stand B requires 8 minutes for sanding, 32 minutes for assembly, and 8 minutes for packaging. The total number of minutes available each day in each department are as follows: for sanding 3360 minutes, for assembly 9600 minutes, and for packaging 2000 minutes. The profit on each lamp stand A is 30 and the profit on each lamp stand B is 22. How many of each type of lamp stand should the company make per day to maximize their profit? What is the maximum profit?
  A) Maximum profit is 6164 when they make 138 of lamp stand A and 92 of lamp stand B
  B) Maximum profit is 6000 when they make 200 of lamp stand A and 0 of lamp stand B
  C) Maximum profit is 6380 when they make 66 of lamp stand A and 200 of lamp stand B
  D) Maximum profit is 7336 when they make 136 of lamp stand A and 148 of lamp stand B

[blfontai]

Answer to Question 1

A

Answer to Question 2

C