Download App

Linear Programming Maths - Linear Programming

Gujarat Board (GSEB) - STD 12 Science - Maths (GSEB - English Medium). 19 questions in this chapter.

Question types

Linear Programming question types

19 questions across 4 question groups — pick any mix to generate a Maths paper with step-by-step answer keys.

19
Questions
4
Question groups
5
Question types
Sample Questions

Linear Programming questions

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

Q 1M.C.Q (1 Marks)1 Mark
In the feasible region, any point which given the optimal value (maximum or minimum) of the objective function, is called :
  • ✓
    optimal solution
  • B
    inconsistent solution
  • C
    feasible solution
  • D
    anomalous solution.

Answer: A.

View full solution →
Q 2M.C.Q (1 Marks)1 Mark
Any point of the outer part of feasible region is called :
  • A
    feasible solution
  • ✓
    inconsistent solution
  • C
    consistent solution
  • D
    anomalous solution.

Answer: B.

View full solution →
Q 3M.C.Q (1 Marks)1 Mark
The maximum solution of the objective function lies :
  • A
    in feasible region
  • ✓
    at the corner of the feasible region
  • C
    has no feasible region
  • D
    none of the above.

Answer: B.

View full solution →
Q 132 Marks2 Marks
Show the feasible region under the constraints :
$
\begin{aligned}
2 x+y & \leq 6 \\
x & \geq 0 \\
y & \geq 0
\end{aligned}
$
View full solution →
Q 142 Marks2 Marks
Show the feasible solution region under the following constraints:
$
8 x+5 y \leq 40, x \geq 0, y \geq 0 .
$
View full solution →
Q 154 Marks4 Marks
Maximize $Z=3 x+2 y$ subject to constraints $x+2 y \leq 10,3 x+y \leq 15, x \geq 0, y \geq 0$ by using graphical method.
View full solution →
Q 164 Marks4 Marks
Maximize $Z=4 x+y$ subject to constraints $x+y$ $\leq 50,3 x+y \leq 90, x \geq 0, y \geq 0$ by using graphical method.
View full solution →
Q 174 Marks4 Marks
Solve the following linear programming problem for minimisation by graphical method :
Objective function
$
\begin{aligned}Z = 5 x + y \\
constraints
3 x + 5 y & \geq 1 5 \\
5 x + 2 y & \leq 1 0 \\
x \geq 0 , y & \geq 0
\end{aligned}
$
View full solution →
Q 184 Marks4 Marks
Solve the following linear programming problem by graphical method. Under the following constraints :
$
\begin{aligned}
x+2 y & \geq 10 \\
x+y & \geq 6 \\
3 x+y & \geq 8 \\
x, y & \geq 0
\end{aligned}
$
$\operatorname{minimise} Z=3 x+5 y$.
View full solution →
Q 194 Marks4 Marks
Solve the following linear programming problem by graphical method.Under the constraints, maximise $Z=60 x+40 y$.
$
\begin{aligned}
x+2 y & \leq 12 \\
2 x+y & \leq 12 \\
x+\frac{5}{4} y & \geq 5 ; x \geq 0, y \geq 0
\end{aligned}
$
View full solution →
Browse all question groups ↑

Generate a 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
Generate Paper FreeAll Maths chapters