A linear programming problem has three parts: decision variables, a linear objective function to be maximised or minimised, and linear constraints, including the non-negative restrictions.
Given: land at most 20 ha; seed budget at most ₹60,000 at ₹2,000 per ha (wheat) and ₹4,000 per ha (mustard); wheat at least 4 ha; profit ₹9,000 per ha (wheat) and ₹12,000 per ha (mustard).
To find: the LPP that maximises profit.
Step 1 — Decision variables. Let the farmer grow x hectares of wheat and y hectares of mustard.
Step 2 — Objective function. The profit, in rupees, is
Z=9000x+12000y
Step 3 — Constraints.
- Land: x+y≤20.
- Seed budget: 2000x+4000y≤60000, which on dividing by 2000 becomes x+2y≤30.
- Contract: x≥4.
- Non-negative restrictions: x≥0 and y≥0. Here x≥0 is already implied by x≥4.
Answer: Maximise Z=9000x+12000y subject to
x+y≤20,x+2y≤30,x≥4,y≥0
Note: "At most" becomes ≤ and "at least" becomes ≥. Write both sides of the budget constraint in rupees before dividing through.