Problem Formulation
Jayesh Runjhunwala wants to invest in two types of bonds: bond X and bond Y. The investment details are as follows:
- Bond X yields 10% simple interest.
- Bond Y yields 15% simple interest.
- Jayesh has a total of Rs 20000 to invest and wants to invest at least Rs 5000 in bond X and no more than Rs 8000 in bond Y.
We need to formulate a linear programming problem to maximize Jayesh's return.
Step 1: Define Variables
Let:
- x be the amount invested in bond X.
- y be the amount invested in bond Y.
Step 2: Objective Function
The objective is to maximize the return from both investments. The returns for each bond can be calculated as simple interest:
- The return from bond X is 10010×x=10x.
- The return from bond Y is 10015×y=203y.
Thus, the objective function to maximize is:
Z=10x+203y
Step 3: Constraints
The constraints based on the problem are as follows:
- The total investment cannot exceed Rs 20000:
x+y≤20000
- At least Rs 5000 should be invested in bond X:
x≥5000
- No more than Rs 8000 should be invested in bond Y:
y≤8000
- Both investments should be non-negative:
x≥0,y≥0
Step 4: Graphing the System of Inequalities
To find the feasible region, we need to graph the system of inequalities:
- x+y≤20000
- x≥5000
- y≤8000
- x,y≥0
The feasible region is the area where all these inequalities overlap.

Step 5: Corner Points
To evaluate the objective function at the corner points of the feasible region, we calculate the coordinates of the intersection points:
- Point A (5000, 0):
Z=105000+203(0)=500
- Point B (20000, 0):
Z=1020000+203(0)=2000
- Point C (12000, 8000):
Z=1012000+203(8000)=1200+1200=2400
- Point D (5000, 8000):
Z=105000+203(8000)=500+1200=1700
Step 6: Optimal Solution
The maximum value of Z occurs at the corner point C, where x=12000 and y=8000. Hence, the optimal solution is:
(12000,8000)
Therefore, Jayesh should invest Rs 12000 in bond X and Rs 8000 in bond Y to maximize his return, which will be Rs 2400.