Class 12

31. Linear Programming question bank (Maths)

Practice 361 free Class 12 Maths - 31. Linear Programming questions with answers and step-by-step solutions.

Start free Book a demo

All Easy Hard Medium

Q1.

The shaded region in the figure is bounded by the inequalities. Find the correct set of inequalities for the shaded region.

(A)

\(14x + 5y \ge 70\)

(B)

\(y \le 14\)

(C)

\(x - y \le 5\)

(D)

\(14x + 5y \le 70\)

Show answer & solution

Verified Answer & Solution Locked

Q2.

An \(n\)-tuple \((x_1,x_2,....,x_n)\) which satisfies all the constraints of a linear programming problem and for which the objective function is maximum (compared to all \(n\)-tuples which satisfy all the constraints) is called

(A)

a solution

(B)

a feasible solution

(C)

an optimal solution

(D)

an actual solution

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 361 Questions in 31. Linear Programming

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 361 questions

Unlock every 31. Linear Programming question, generate papers, and practice at your own pace.

Start free