Linear Programming Problem Formulation
A packaging company produces two types of boxes: rectangular boxes and circular boxes. The company wants to maximize the profit from a client order of 25 boxes to be ready in one hour.
Given:
-
Rectangular Box:
- Takes 2 minutes to make.
- Sells for a profit of Rs 4.
-
Circular Box:
- Takes 3 minutes to make.
- Sells for a profit of Rs 5.
The client requests 25 boxes in total, and the company has a time constraint of 60 minutes (1 hour).
Step 1: Define Variables
Let:
- ( r ) be the number of rectangular boxes produced.
- ( c ) be the number of circular boxes produced.
Step 2: Objective Function
The objective is to maximize the total profit, which is the sum of the profit from rectangular boxes and circular boxes:
- Profit from rectangular boxes = ( 4r ) (since each rectangular box gives Rs 4).
- Profit from circular boxes = ( 5c ) (since each circular box gives Rs 5).
Thus, the objective function to maximize is:
[
\text{Maximize } Z = 4r + 5c
]
Step 3: Constraints
-
Box Quantity Constraint: The total number of boxes produced must be 25:
[
r + c = 25
]
-
Time Constraint: The time taken to produce the boxes must not exceed 60 minutes:
- Rectangular boxes take 2 minutes each, so ( 2r ) minutes are required for ( r ) rectangular boxes.
- Circular boxes take 3 minutes each, so ( 3c ) minutes are required for ( c ) circular boxes.
The total time constraint is:
[
2r + 3c \leq 60
]
-
Non-Negativity Constraints: The number of boxes must be non-negative:
[
r \geq 0, \quad c \geq 0
]
Final Linear Programming Problem (LPP)
The Linear Programming Problem can be summarized as follows:
Objective:
[
\text{Maximize } Z = 4r + 5c
]
Subject to the constraints:
[
r + c = 25
]
[
2r + 3c \leq 60
]
[
r \geq 0, \quad c \geq 0
]
This linear programming problem maximizes the profit while adhering to the constraints on the number of boxes and the time available for production.