Question

Consider the following linear program which maximizes profit for two products, Regular (R), and Super (S)

Z- MAX 5OR+75S
S.t
1.6S s 600 assembly (hours)
0.8R+ 0.5S s 300 paint (hours)
0.16R+ 0.4S s 100 inspection (hours)
Computer Solution Sensitivity Report
Call Name Vinal Valeu Reduced Cost Objective Coeffiecient Allowable Increase Allowable Descrease
SB$7 Reguller= 291.67 0.00 50 70 20
SB$7 Super= 133.33 0.00 75 50 43.75

Call Name Vinal Valeu Reduced Cost Objective Coeffiecient Allowable Increase Allowable Descrease
SES3 Assebly (hr/unit) 563.33 0.00 600 IE+30 36.67
SES4 Paitn (hr/unit) 300.00 33.33 100 39.29 175
SES5 Insoect (hr/unit) 100.00 145.83 300 12.94 40

Fill the following blanks:
The optimal number of Regular (R) products to produce isand the optimal number , for a total profit of of Super (S) products to produce is

Answer 1

The optimal number of Regular (R) products to produce is 291.67, and the optimal number of Super (S) products to produce is 133.33, for a total profit of $7.

Step-by-step explanation:

The linear program that maximizes profit for Regular (R) and Super (S) products is as follows:

Maximize 5R + 75S

Subject to:

1.6S ≤ 600 (assembly hours)

0.8R + 0.5S ≤ 300 (paint hours)

0.16R + 0.4S ≤ 100 (inspection hours)

From the provided computer solution sensitivity report, we can determine the optimal number of Regular (R) products to produce and the optimal number of Super (S) products to produce. The optimal number of Regular (R) products is 291.67, and the optimal number of Super (S) products is 133.33. The total profit is $7.