GROUP 3: SOLUTIONS
Problem 1: Maximization
Objective: Maximize Z = x₁ + x₂
Subject to constraints:
(1) 2x₁ + x₂ ≤ 10
(2) x₁ + x₂ ≤ 15
(3) x₂ ≤ 4
(4) x₁, x₂ ≥ 0
Step-by-step Solution:
1. Convert constraints into equalities to plot on graph.
2. Identify intercepts:
- (1) → (0,10) and (5,0)
- (2) → (0,15) and (15,0)
- (3) is a horizontal line at y=4
3. Plot in first quadrant and find overlapping shaded region.
4. Identify feasible region and corner points: (0,0), (3,4), (4,4), (5,0)
5. Evaluate Z = x₁ + x₂:
- (0,0): Z = 0
- (3,4): Z = 7
- (4,4): Z = 8 (Maximum)
- (5,0): Z = 5
Optimal Solution:
- x₁ = 4, x₂ = 4
-Z=8
Problem 2: Maximization
Objective: Maximize Z = 80x + 70y
Subject to:
(1) x + y ≤ 8
(2) x + y ≥ 2
(3) x ≤ 5
(4) y ≤ 6
(5) x, y ≥ 0
Step-by-step Solution:
1. Plot constraints and find intersection of shaded areas.
2. Identify corner points of feasible region: (0,2), (2,0), (5,3), (2,6), (0,6)
3. Evaluate Z:
- (0,2): Z = 140
- (2,0): Z = 160
- (5,3): Z = 610 (Maximum)
- (2,6): Z = 580
- (0,6): Z = 420
Optimal Solution:
- x = 5, y = 3
- Z = 610
Problem 3: Maximization
Objective: Maximize Z = 80x + 10y
Subject to:
(1) 2x + 5y ≤ 6
(2) x + 2y ≥ 6
(3) x, y ≥ 0
Step-by-step Solution:
1. Convert equations to equalities.
2. Attempt to solve system:
- From 2x + 5y = 6 and x + 2y = 6
- Multiply 2nd by 2: 2x + 4y = 12
- Subtract: y = -6 → not valid in first quadrant.
3. Therefore, no overlapping feasible region.
Conclusion:
- No feasible solution
Problem 4: Minimization
Objective: Minimize Z = 3x + 4y
Subject to:
(1) 4x + 2y ≥ 32
(2) x + 3y ≥ 18
(3) x, y ≥ 0
Step-by-step Solution:
1. Plot both constraints on graph.
2. Solve system:
- 4x + 2y = 32
- x + 3y = 18
- Multiply 2nd by 4: 4x + 12y = 72
- Subtract: 10y = 40 → y = 4
- Substitute: x = 6
3. Evaluate Z = 3x + 4y = 3(6) + 4(4) = 34
Optimal Solution:
- x = 6, y = 4
- Z = 34
Summary Table
Problem Type Objective Optimal Point Optimal Value
Function
1 Maximize Z = x₁ + x₂ (4, 4) 8
2 Maximize Z = 80x + 70y (5, 3) 610
3 Maximize Z = 80x + 10y None None
4 Minimize Z = 3x + 4y (6, 4) 34
Decision Making Analysis
🔹 Problem 1 Decision Making
The optimal decision is to allocate 4 units to x₁ and 4 units to x₂ to maximize output. This
results in the highest combined value of Z = 8, while complying with all resource
constraints. This allocation ensures efficient use of limited capacity and fulfills all
operational limits, making it the best strategy.
🔹 Problem 2 Decision Making
The best course of action is to produce 5 units of x and 3 units of y, resulting in a maximum
profit of Z = 610. This combination uses the available capacity effectively and meets all
constraints. Management should implement this strategy for optimal profitability.
🔹 Problem 3 Decision Making
There is no feasible solution. This indicates an inconsistency in constraints (e.g., unrealistic
limits or conflicting requirements). Decision-makers should reassess the situation—
perhaps by loosening some constraints or redefining the objective function—to make the
model solvable.
🔹 Problem 4 Decision Making
To minimize cost, the best decision is to choose x = 6 and y = 4, yielding the lowest value of
Z = 34. This choice optimizes cost efficiency while satisfying all minimum requirements. It's
an ideal strategy for lean operations.
Graph
