MCQ
Objective function of a L.P.P. is:
  • A
    A constant
  • B
    A function to be optimised
  • C
    A relation between the variables
  • D
    None of these 

Answer

  1. A function to be optimised

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

Similar questions

Area bounded by curve y² = 4x, y-axis and line y = 3 is (in sq units)
Find the value of $\lambda$ for which the vectors $3 \hat{i}-6 \hat{j}+\hat{k}$ and $2 \hat{i}-4 \hat{j}+\lambda \hat{k}$ are parallel.
Let $a $ and $ b$ be two unit vectors inclined at an angle $\theta $, then $\sin \,(\theta /2)$ is equal to
If the vectors $\left( {1 - x} \right)\hat i\, + \,\hat j\, + \,\hat k,\hat i\, + \,\left( {1 - y} \right)\,j\, + \,\hat k$ and $\hat i + \hat j + \left( {1 - z} \right)\hat k$ are coplanar vectors, then value of $\frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ is ($x, y, z$ are non zero numbers)
Let $\mathrm{x}=\frac{\mathrm{m}}{\mathrm{n}}$ ( $\mathrm{m}, \mathrm{n}$ are co-prime natural numbers) be a solution of the equation $\cos \left(2 \sin ^{-1} x\right)=\frac{1}{9}$ and let $\alpha, \beta(\alpha>\beta)$ be the roots of the equation $\mathrm{mx}^2-\mathrm{nx}-$ $\mathrm{m}+\mathrm{n}=0$. Then the point $(\alpha, \beta)$ lies on the line
$\mathop {\lim }\limits_{n \to \infty } \,\sum\limits_{r = 0}^n {\frac{n}{{{{\left( {2r + n} \right)}^2}}}} $ is equal to
If $|\vec{\text{a}}|=\big|\vec{\text{b}}\big|,$ then $\big(\vec{\text{a}}+\vec{\text{b}}\big).\big(\vec{\text{a}}-\vec{\text{b}}\big)=$
  1. Positive
  2. Negetive
  3. 0
  4. None of these
The solution of the differential equation ${(x + y)^2}\frac{{dy}}{{dx}} = {a^2}$ is
The corner points of the feasible region are $A(3,3), B(20,3), C(20,10), D(18,12)$ and $E(12, 12)$. The maximum value of $Z=2 x+3 y$ is $.......$
To write the dual; it should be ensured that
  1.  All the primal variables are non - negative.
  2. All the bi values are non - negative.
  3. All the constraints are $\leq$ type if it is maximization problem and $\geq$ type if it is a minimization problem.
  1. I and II
  2. II and III
  3. I and III
  4. I, II and IIl