MHT-CET

31. Linear Programming question bank (Mathematics)

Practice 120 free MHT-CET Mathematics - 31. Linear Programming questions with answers and step-by-step solutions.

Start free Book a demo

All Easy Hard Medium

Q1.

If $Z = 7x + y$ subject to $5x + y \geq 5$,$x + y \geq 3$,$x \geq 0$,$y \geq 0$,then the minimum value of $Z$ is

(A)

$2$

(B)

$5$

(C)

$6$

(D)

$3$

Show answer & solution

Verified Answer & Solution Locked

Q2.

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

(A)

a triangle

(B)

a square

(C)

a pentagon

(D)

a quadrilateral

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 33 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 33 questions

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

Start free