Step 1: Understanding the Concept:
This is a Linear Programming problem. We need to check which plan stays within the machine hour limits while providing the highest profit.
Step 2: Key Formula or Approach:
Constraints:
1. Machine A: \(4S + 5D \le 700\)
2. Machine B: \(6S + 10D \le 1250\)
Profit = \(20S + 30D\).
Step 3: Detailed Explanation:
Let's check the options for feasibility:
- (A) 100S, 60D: \(4(100)+5(60)=700\) (OK); \(6(100)+10(60)=1200\) (OK). Profit = \(2000+1800=3800\).
- (B) 75S, 80D: \(4(75)+5(80)=300+400=700\) (OK); \(6(75)+10(80)=450+800=1250\) (OK). Profit = \(1500+2400=3900\).
- (D) 60S, 90D: \(4(60)+5(90)=240+450=690\) (OK); \(6(60)+10(90)=360+900=1260\) (NOT OK).
- (E) 50S, 100D: \(4(50)+5(100)=700\) (OK); \(6(50)+10(100)=1300\) (NOT OK).
Comparing valid plans: Plan B (3900) is higher than Plan A (3800).
Step 4: Final Answer:
Standard 75 bags, Deluxe 80 bags maximizes profit.