Download App

Linear Programming — Maths STD 12 Science — Question

Gujarat BoardEnglish MediumSTD 12 ScienceMathsLinear Programming1 Mark
MCQ

The value of objective function is maximum under linear constraints

    • A
      at the centre of feasible region
    • B
      at (0, 0)
    • C
      at any vertex of feasible region
    • D
      the vertex which is maximum distance from (0, 0)
    ✓

    Answer

    1. at any vertex of feasible region

    Solution:

    In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we obtain the maximum or minimum value.

    Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.

    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→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

    Similar questions

    ${\tan ^{ - 1}}\,\left[ {\frac{{\sqrt {1 + {x^2}} + \sqrt {1 - {x^2}} }}{{\sqrt {1 + {x^2}} - \sqrt {1 - {x^2}} }}} \right] = $
    →
    If $\text{y}=\log\sqrt{\tan\text{x}},$ then the value of $\frac{\text{dy}}{\text{dx}}$ at $\text{x}=\frac{\pi}{4}$ is givne by:
    1. $\infty$
    2. $1$
    3. $0$
    4. $\frac{1}{2}$
    →
    The value of the determinant $\begin{vmatrix}\text{a}-\text{b}&\text{b}+\text{c}&\text{c}\\\text{b}-\text{c}&\text{c}+\text{b}&\text{b}\\\text{c}+\text{a}&\text{a}+\text{b}&\text{c}\end{vmatrix}$ is:
    1. a3 + b3 + c3
    2. 3bc
    3. a3 + b3 + c3 - 3abc
    4. None of these
    →
    If the position vectors of the points $A$  and $B$  are $i + 3j - k$ and $3i - j - 3k,$ then what will be the position vector of the mid point of  $AB$ 
    →
    If $A = \left[ {\begin{array}{*{20}{c}}
      1&0&0 \\ 
      2&1&0 \\ 
      { - 3}&2&1 
    \end{array}} \right]\,$ and $B = \left[ {\begin{array}{*{20}{c}}
      1&0&0 \\ 
      { - 2}&1&0 \\ 
      7&{ - 2}&1 
    \end{array}} \right]$ then $AB$ equals
    →
    Let X1 and X2 are optimal solutions of a LPP, then:
    →
    The scalar projection of the vector $3 \hat{ i }-\hat{ j }-2 \hat{ k }$ on the vector $\hat{i}+2 \hat{j}-3 \hat{k}$ is
    →
    If $\int_0^{2a} {f(x)\,dx = 2\int_0^a {f(x)\,dx,} } $ then
    →
    The set of equations $x - y + 3z = 2 , 2x - y + z = 4 , x - 2y + \alpha z = 3$ has
    →
    The following system of linear equations  $2 x+3 y+2 z=9$ ; $3 x+2 y+2 z=9$  ;$x-y+4 z=8$
    →