Question types

STD 12 - 12. linear programming question types

55 questions across 1 question group — pick any mix to generate a Mathematics paper with step-by-step answer keys.

55
Questions
1
Question groups
5
Question types
Sample Questions

STD 12 - 12. linear programming questions

One sample from each question group in this chapter. Select any group above to see the full set with answer keys.

For the $LP$ problem

"Maximize $z=x+4 y$

subject to $3 x+6 y \leq 6,4 x+8 y \geq 16$ and $x \geq 0, y \geq 0$."

  • A
    $4$
  • B
    $8$
  • C
    feasible region is unbounded
  • has no feasible region

Answer: D.

View full solution
For the $LP$ problem

Maximize $z=2 x+3 y$ the coordinates of the corner points of the bounded feasible region are $A\,(3,3), B\,(20,3),$ $\mathrm{C}\,(20,10), \mathrm{D}\,(18,12)$ and $\mathrm{E}\,(12,12) .$ The maximum value of $z$ is $\ldots \ldots$

  • $72$
  • B
    $80$
  • C
    $82$
  • D
    $70$

Answer: A.

View full solution
For the $LP$ problem

Minimize $z=2 x+3 y$ the coordinates of the corner points of the bounded feasible region are $A\,(3,3), B\,(20,3),$ $\mathrm{C}\,(20,10), \mathrm{D}\,(18,12)$ and $\mathrm{E}\,(12,12) .$ The minimum value of $z$ is $\ldots \ldots$

  • A
    $49$
  • $15$
  • C
    $10$
  • D
    $05$

Answer: B.

View full solution
Solution of the following $LP$ problem

Maximize $z=2 x+6 y$ subject to $-x+y \leq 1,2 x+y \leq 2$ and $x \geq 0, y \geq 0 "$ is $.......$

  • A
    $\frac{4}{3}$
  • B
    $\frac{1}{3}$
  • $\frac{26}{3}$
  • D
    no feasible region

Answer: C.

View full solution
Solution of the following $LP$ problem

Minimize $z=-3 x+2 y$

subject to $0 \leq x \leq 4,1 \leq y \leq 6, x+y \leq 5$ is $.....$

  • $-10$
  • B
    $00$
  • C
    $02$
  • D
    $10$

Answer: A.

View full solution

Generate a STD 12 - 12. linear programming paper free

Pick question groups from the list above, set marks and difficulty, and export a branded PDF with step-by-step answer keys. First 3 chapters free — no signup.

Download App