Question
The objective function of a linear programming problem is:
  1. A constraint
  2. Function to be optimised
  3. A relation between the variables
  4. None of these

Answer

  1. 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

$\int\limits^\sqrt{3}_1\frac{1}{1+\text{x}^2}\text{ dx}$ is equal to:
  1. $\frac{\pi}{12}$
  2. $\frac{\pi}{6}$
  3. $\frac{\pi}{4}$
  4. $\frac{\pi}{3}$
In transportation models designed in linear programming, points of demand is classified as:
An anti-aircraft gun take a maximum of four shots at an enemy plane moving away from it. The probability of hitting the plane at the first, second, third and fourth shot are $0.4, 0.3, 0.2$ and $0.1$ respectively. The probability that the gun hits the plane is
Area bounded by the curve $\text{y}=\log\text{x}$ and the coordinate axes is:
  1. $2$
  2. $1$
  3. $5$
  4. $2\sqrt{2}$
If $f(x) = \left\{ \begin{array}{l}\frac{x}{{{e^{1/x}} + 1}},\,\,{\rm{when\,\,}}\,\,x \ne 0\\\,\,\,\,\,\,\,\,\,\,\,\,\,\,0,\,\,{\rm{when \,\,}}x = 0\end{array} \right.$, then
For the following LPP, maximise $Z=3 x+4 y$ subject to constraints $x-y \geq-1, x \leq 3, x \geq 0, y \geq 0$ the maximum value is
If $y = \frac{x}{{\ln \,|c\,x|}}$ (where $c$ is an arbitrary constant) is the general solution of the differential equation $\frac{{dy}}{{dx}} =  \frac{y}{x}+  \phi \left( {\frac{x}{y}} \right)$ then the function $\phi \left( {\frac{x}{y}} \right)$ is :
If $f(x) = {e^x}g(x),g(0) = 2,g'(0) = 1$, then $f'(0)$ is
The number of constraints allowed in a linear program is which of the following?
  1. Less than 5
  2. Less than 72
  3. Less than 512
  4. Less than 1,024
  5. Unlimited
If $\vec{\text{r}}.\vec{\text{a}}=\vec{\text{r}}.\vec{\text{b}}=\vec{\text{r}}.\vec{\text{c}}=0$ for some non-zero vector $\vec{\text{r}},$ then the value of $\big[\vec{\text{a}}\vec{\text{ b }}\vec{\text{c}}\big],$ is:
  1. 2
  2. 3
  3. 0
  4. None of these