PrepKiYour AI companion for entrance exam preparation
MHT-CET MATHEMATICS NOTES

Formulation of LPP

MHT-CET · Mathematics · Linear Programming · Std XII

Summary

A linear programming problem (LPP) asks for the best value (maximum or minimum) of a linear expression, when the variables must obey a set of linear inequations. Every LPP has the same parts. Learn the words: questions ask for them directly.

Formulating means turning the words into Z and the constraints. Do it in the same order every time and most problems become routine.

Key formulas

Objective function
Z = px + qy
Resource limit
(use per unit of A)x + (use per unit of B)y ≤ available
Minimum requirement
(content per unit of A)x + (content per unit of B)y ≥ needed
Ratio condition
at least k times: x ≥ ky
Percentage return
r % of ₹x = (r/100)x
Non-negativity
x ≥ 0, y ≥ 0

What this note covers

  • Objective function and constraints
  • Mathematical formulation of LPP

Solved past-paper question (MHT-CET 2013)

A dealer buys type A and B, with ₹580 and space for 40 items. A costs ₹75 and B costs ₹90, with profits ₹10 and ₹15. Formulate the LPP to maximise profit.

  1. (A) Max Z = 10x + 15y; x + y ≤ 40, 75x + 90y ≤ 580, x,y ≥ 0
  2. (B) Max Z = 10x + 15y; x + y ≥ 40, x,y ≥ 0, 75x + 90y ≥ 580
  3. (C) Max Z = 15x + 10y; x + y ≤ 40, 75x + 90y ≤ 580, x,y ≥ 0
  4. (D) Max Z = 10x + 15y; x + y ≥ 40, 75x + 90y ≤ 580, x,y ≥ 0

Solution

  1. Let x be the number of items of type A and y the number of type B.

    x = number of A, y = number of B

  2. Profit is ₹10 on A and ₹15 on B, and profit is to be maximised.

    Max Z = 10x + 15y

  3. The space holds at most 40 items.

    x + y ≤ 40

  4. The money spent cannot exceed ₹580: A costs ₹75 and B costs ₹90.

    75x + 90y ≤ 580

  5. Numbers of items cannot be negative.

    x, y ≥ 0

  6. This matches the option with Max Z = 10x + 15y, x + y ≤ 40, 75x + 90y ≤ 580.

Answer: (A) Max Z = 10x + 15y; x + y ≤ 40, 75x + 90y ≤ 580, x,y ≥ 0

Common mistake: Writing ≥ for the budget and space limits. They are limits, so they are ≤.

The full note has 8 solved questions, 8 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.

PDF download is included in PrepKi plans. See plans.

More notes in Linear Programming