Multiple Choice
A pharmaceutical company produces three kinds of cold formulas: I, II, and III. It takes 5 hr to produce 1,000 bottles of formula I, 4 hr to produce 1,000 bottles of formula II, and 3 hr to produce 1,000 bottles of formula III. The profits for each 1,000 bottles of formula I, formula II, and formula III are $240, $170, and $210, respectively. Suppose, for a certain production run, there are enough ingredients on hand to make at most 7,000 bottles of formula I, 13,000 bottles of formula II, and 6,000 bottles of formula III. Furthermore, suppose the time for the production run is limited to a maximum of 90 hr. How many bottles of each formula should be produced in this production run so that the profit is maximized? What is the maximum profit realizable by the company? Are there any resources left over?
A) 6,000 bottles of formula I, 7,000 bottles of formula II, 9,250 bottles of formula III; maximum profit: $8,631.15; Yes, ingredients for 3,750 bottles of formula III
B) 9,250 bottles of formula I, 6,000 bottles of formula II, 7,000 bottles of formula III; maximum profit: $8,524.95; Yes, ingredients for 3,750 bottles of formula I
C) 7,000 bottles of formula I, 9,250 bottles of formula II, 6,000 bottles of formula III; maximum profit: $4,512.50; Yes, ingredients for 3,750 bottles of formula II
D) 16,250 bottles of formula I, no bottles of formula II, 9,250 bottles of formula III; maximum profit: $6,921.35; Yes, 3 hr of the time for the production run
Correct Answer:

Verified
Correct Answer:
Verified
Q62: Determine wheather the given simplex table is
Q63: Consider the linear programming problem. <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6027/.jpg"
Q64: Use the simplex method for solving nonstandard
Q65: As part of a campaign to promote
Q66: Use the Simplex Method for Solving Nonstandard
Q68: A farmer has 150 acres of land
Q69: Solve the linear programming problem by the
Q70: Solve the linear programming problem by the
Q71: Natsano has at most $60,000 to invest
Q72: Use the Simplex Method for Solving Nonstandard