CBSE Class 12 · 2017 · Linear ProgrammingLong Answer

WhatsApp Email
Solve the following L.P.P. graphically:
Minimize
subject to the constraints



Answer: Min Z = 300 at (60, 0)

Solution

Boundary lines: , and .
Corner points of the feasible region: , , (intersection of and ) and (intersection of and ).
Evaluate :
: ← minimum
:
:
:
Structure Feasible region for x + 2y = 120, x + y = 60 and x - 2y = 0, with corner points A(60, 0), B(120, 0), C(60, 30) and D(40, 20).
Feasible region for x + 2y = 120, x + y = 60 and x - 2y = 0, with corner points A(60, 0), B(120, 0), C(60, 30) and D(40, 20).

CBSE Class 12 Board · 2017 · Subjective

More board questions on Linear Programming

  1. Solve the following Linear Programming problem graphically:
    Maximize
    subject to



    CBSE 2024View solution →
  2. The objective function of an LPP has maximum value 42 at and minimum value 19 at . Which of the following is true?
    CBSE 2023View solution →
  3. The corner points of the feasible region of a linear programming problem are , and . If is the objective function, then (maximum value of minimum value of ) is equal to:
    CBSE 2023View solution →
  4. Solve the following linear programming problem graphically:
    Maximize
    subject to the constraints



    CBSE 2023View solution →
  5. The corner points of the feasible region determined by the system of linear inequalities are , , and . If the maximum value of , where , occurs at both and , then:
    CBSE 2020View solution →
  6. A furniture trader deals in only two items — chairs and tables. He has Rs. 50,000 to invest and a space to store at most 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. For …
    CBSE 2020View solution →