Problem Formulation
The consultancy firm needs to book buses for its 400 employees and minimize the total rental cost. The bus rental company offers two types of buses: Large and Medium. The maximum capacities and rental costs are provided below:
| Bus type | Maximum capacity | Rental cost (in Rs.) |
|---|
| Large | 50 | 3000 |
| Medium | 40 | 2000 |
The company can book a maximum of 9 drivers, and the number of buses should ensure that at least 400 employees are accommodated.
Let:
- ( x ) be the number of Large buses.
- ( y ) be the number of Medium buses.
Step 1: Define the Objective Function
We want to minimize the total rental cost. The total rental cost is:
- ( 3000x ) for the Large buses.
- ( 2000y ) for the Medium buses.
Thus, the objective function is:
[
\text{Minimize } Z = 3000x + 2000y
]
Step 2: Define the Constraints
-
Capacity constraint: The total capacity must be at least 400 employees. Since each Large bus has a capacity of 50 and each Medium bus has a capacity of 40, the constraint is:
[
50x + 40y \geq 400
]
-
Driver constraint: There are a maximum of 9 drivers available, so the number of buses (Large + Medium) should not exceed 9:
[
x + y \leq 9
]
-
Non-negativity constraints: The number of buses cannot be negative:
[
x \geq 0, \quad y \geq 0
]
Step 3: Linear Programming Problem (LPP)
The linear programming problem can be summarized as follows:
Objective:
[
\text{Minimize } Z = 3000x + 2000y
]
Subject to the constraints:
[
50x + 40y \geq 400
]
[
x + y \leq 9
]
[
x \geq 0, \quad y \geq 0
]
Step 4: Sketch the Feasible Region
To graph the feasible region, plot the constraints on a coordinate plane:
-
First constraint: ( 50x + 40y \geq 400 ) can be rewritten as:
[
y \geq \frac{400 - 50x}{40} = 10 - \frac{5x}{4}
]
This line represents the minimum capacity requirement.
-
Second constraint: ( x + y \leq 9 ) can be rewritten as:
[
y \leq 9 - x
]
This line represents the driver constraint.
-
Non-negativity constraints: The region is bounded by the ( x )-axis and the ( y )-axis (since ( x \geq 0 ) and ( y \geq 0 )).
The feasible region is the area where all these inequalities overlap.
Step 5: Evaluate the Objective Function at the Corner Points
The optimal solution will occur at one of the corner points of the feasible region. We now evaluate the objective function ( Z = 3000x + 2000y ) at the corner points.
Corner 1: ( (4, 5) )
[
Z = 3000(4) + 2000(5) = 12000 + 10000 = 22000
]
Corner 2: ( (8, 0) )
[
Z = 3000(8) + 2000(0) = 24000 + 0 = 24000
]
Corner 3: ( (9, 0) )
[
Z = 3000(9) + 2000(0) = 27000 + 0 = 27000
]
Step 6: Conclusion
The optimal solution occurs at the point ( (4, 5) ), where the minimum total rental cost is Rs 22000. This corresponds to booking 4 Large buses and 5 Medium buses.
Final Answer:
- Optimal solution: Book 4 Large buses and 5 Medium buses for a total cost of Rs 22000.