Download App

Linear Programming — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSLinear Programming1 Mark
Question
Choose the correct answer from the given four options.

The feasible solution for a LPP shown in Fig. 12.12. Let z = 3x - 4y be objective functio. (Maximum value of Z + Minimum value of Z) is equal to:
  1. 13.
  2. 1.
  3. -13.
  4. -17.
✓

Answer

  1. -17.
Solution:
Corner points
Corresponding value of Z = 3x - 4y
(0, 0)
(5, 0)
(6, 5)
(6, 8)
(4, 10)
(0, 8)
0
15 (Maximum)
-2
-14
-28
-32 (Minimum)
Here, maximum value of Z + minimum value of Z = 15 - 32 = -17.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q (1 Marks)" from Linear Programming→Linear Programming — all question types→MATHS STD 12 Science question papers→Rajasthan Board STD 12 Science question papers→Rajasthan Board question paper generator→

Similar questions

The probability that a leap year will have $53$ sundays is:
→
The degree of the differential equation $\big(\frac{\text{d}^{2}\text{y}}{\text{dx}^{2}}\big)^{3}+\big(\frac{\text{dy}}{\text{dx}}\big)^{2}+\sin\big(\frac{\text{dy}}{\text{dx}}\big)+1=0$ is:
  1. 3
  2. 2
  3. 1
  4. Not defined.
→
Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is:
  1. Symmetric but not transitive.
  2. Transitive but not symmetric.
  3. Neither symmetric nor transitive.
  4. Both symmetric and transitive.
→
The area of a triangle with vertices A, B, C is given by
→
Maximize Z = 11 x + 8y subject to $\text{x}\leq4,\text{y}\leq6,\text{x}+\text{y}\leq6,\text{x}\geq0,\text{y}\geq0.$
  1. 44 at (4, 2)
  2. 60 at (4, 2)
  3. 62 at (4, 0)
  4. 48 at (4, 2)
→
Choose the correct answer from the given four options. Two dice are thrown. If it is known that the sum of numbers on the dice was less than $6,$ the probability of getting a sum $3,$ is:
→
Area bounded by the lines y = |x| - 2 and y = 1 - |x - 1| is equal to:
  1. 4 sq. units
  2. 6 sq. units
  3. 2 sq. units
  4. 8 sq. units
→
Find which of the binary operations are commutative and which are associative.
Consider a binary operation $*$ on $N$ defined as $a * b = a^3 + b^3$. Choose the
correct answer.
→
The value of objective function is maximum under linear constraints
→
If $f: R \rightarrow R_{,} f(x)=3 x-5$, then the value of $fo f(3)$ is
→