CBSE Class 12 · 2023 · Linear ProgrammingLong Answer

WhatsApp Email
Solve the following linear programming problem graphically:
Maximize
subject to the constraints



Answer: Max Z = 400 at (0, 200)

Solution

Convert the inequalities to boundary lines: , and .
The feasible corner points are:
— meets
— meets
— meets
— meets
Evaluate :
:
:
:
: ← maximum
Structure Feasible region bounded by x + 2y = 100, 2x - y = 0 and 2x + y = 200, with corner points A(0, 50), B(20, 40), C(50, 100) and D(0, 200).
Feasible region bounded by x + 2y = 100, 2x - y = 0 and 2x + y = 200, with corner points A(0, 50), B(20, 40), C(50, 100) and D(0, 200).

CBSE Class 12 Board · 2023 · 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. 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 →
  5. 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 →
  6. A company produces two types of goods A and B that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of gold while that of type B requires 1 g of silver and 2 g of gold. The company can use at most 9 g of silver and 8 g of gold. If each unit of type A br …
    CBSE 2019View solution →