Problem Overview
Sameer has framed the following linear programming problem to minimize the monthly operational cost in running his bakery:
-
Objective function: Minimize Z=200x+300y, where:
- x is the number of orders for bread loaves.
- y is the number of orders for cakes.
-
Constraints:
- 2x+3y≥1200
- 1.5y+2x≥900
- x+y≤400
- x≥0,y≥0

Step 1: Graph the Constraints
The feasible region is the area where all the constraints overlap. To graph the constraints, we can start by finding the boundary lines for each inequality.
-
First constraint: 2x+3y≥1200
- Rearranged form: y≥31200−2x.
- This is a line with a slope of −32, and the y-intercept is 400.
-
Second constraint: 1.5y+2x≥900
- Rearranged form: y≥1.5900−2x or y≥600−34x.
- This is a line with a slope of −34, and the y-intercept is 600.
-
Third constraint: x+y≤400
- Rearranged form: y≤400−x.
- This is a line with a slope of −1 and the y-intercept is 400.
-
Non-negativity constraints: x≥0 and y≥0.
Step 2: Analyze the Feasible Region
The feasible region is the area where all the inequalities overlap. However, in this case, we can observe that:
- The first two constraints together are satisfiable (their boundary lines meet at (300,200)), but they cannot be met together with x+y≤400.
- Indeed, for any point with x≥0 and x+y≤400 we also have y≤400, so 2x+3y=2(x+y)+y≤800+400=1200, with equality only at (0,400). So 2x+3y≥1200 forces (x,y)=(0,400), but there 2x+1.5y=600<900, violating the second constraint.
Conclusion: No Feasible Region Exists
Since the constraints do not overlap in a way that defines a feasible region, there is no feasible solution to the problem. This means that Sameer cannot achieve an optimal solution because the feasible region does not exist.
Thus, the optimal solution does not exist for this linear programming problem.
Final Answer:
There is no optimal solution, as no feasible region exists for this linear programming problem.