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.

The difference between the maximum value and the minimum value of the objective function $z = 3x + y$ subject to the constraints $2x + 3y \leq 6$, $x + y \geq 1$, $x \geq 0$, $y \geq 0$ is....

(A)
$7$
(B)
$3$
(C)
$8$
(D)
$1$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.

The maximum value of $z=6x+8y$ subject to the constraints $x-y \geq 0$,$x+3y \leq 12$,$x \geq 0$,$y \geq 0$ is:

(A)
$72$
(B)
$42$
(C)
$96$
(D)
$24$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 45 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 in to unlock Create free account

Sign up free to access all 45 questions

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

Start free