Essay
A small firm makes three products, which all follow the same three-step process, which consists of milling, inspection, and drilling. Product A requires 6 minutes of milling, 5 minutes of inspection, and 4 minutes of drilling; product B requires 2.5 minutes of milling, 2 minutes of inspection, and 2 minutes of drilling; and product C requires 5 minutes of milling, 4 minutes of inspection, and 8 minutes of drilling. The department has 20 hours available during the next period for milling, 15 hours for inspection, and 24 hours for drilling. Product A contributes $6.00 per unit to profit, product B contributes $4.00 per unit, and product C contributes $10.00 per unit.
Use the following computer output to find the optimum mix of products in terms of maximizing contributions to profits for the next period.
PROBLEM TITLE: LINEAR PROGRAMMING
PROBLEM IS A MAX WITH 3 VARIABLES AND 3 CONSTRAINTS. NUMBER OF ITERATIONS: 2
OPTIMAL SOLUTION:
OBJECTIVE FUNCTION VALUE = 2,070
DECISION VARIABLE SECTION: SLACK VARIABLES SECTION:
Correct Answer:

Verified
Correct Answer:
Verified
Q3: The theoretical limit on the number of
Q8: A company produces two products (A and
Q9: A company produces two products (A and
Q34: Graphical linear programming can handle problems that
Q35: Coordinates of all corner points are substituted
Q51: The equation 3 xy = 9 is
Q75: The logistics/operations manager of a mail order
Q77: Linear programming techniques will always produce an
Q96: The production planner for Fine Coffees, Inc.,
Q98: A change in the value of an