Download App

Linear Programming — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSLinear Programming1 Mark
Question
Objective of linear programming for an objective function is to:
✓

Answer

  1. Maximize or minimize.
Solution:
In linear programming, the objective function is the linear equation which is representing some quantity (such as profit gained, cost, ...) which is to be maximized or minimized subject to the given constraints.

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

Domain of $f(x)=\sin ^{-1} \sqrt{x-1}$ is :
→
The general solution of the differntial equation $\frac{\text{dy}}{\text{dx}}=\frac{\text{y}}{\text{x}}$ is:
  1. $\log\text{y}=\text{kx}$
  2. $\text{y}=\text{kx}$
  3. $\text{xy}=\text{k}$
  4. $\text{y}=\text{k}\log\text{x}$ 
→
The area (in sq. units) bounded by the curves $\text{y}=\sqrt{\text{x}},2\text{y}-\text{x}+3=0$ and x-axis lying in the first quadrant is:
  1. $9$
  2. $36$
  3. $18$
  4. $\frac{27}{4}$
→
If the fucnction $\text{f(x)}=\begin{cases}(\cos\text{x})^{\frac{1}{\text{x}}},&\text{x}\neq0\\\text{k},&\text{x}=0\end{cases}$ is continuouse at x = 0, then the value of k is:
  1. 0
  2. 1
  3. -1
  4. e
→
Direction ratio of line joining (2, 3, 4) and (-1, -2, 1), are:
→
For non-zero vectors $\vec{\text{a}},\vec{\text{b}}$ and $\vec{\text{c}}$ the relation $\big|\big(\vec{\text{a}}\times\vec{\text{b}}\big).\vec{\text{c}}\big|=\big|\vec{\text{a}}\big|\big|\vec{\text{b}}\big|\big|\vec{\text{c}}\big|$ holds good, if:
  1. $\vec{\text{a}}.\vec{\text{b}}=\vec{\text{b}}.\vec{\text{c}}=0$
  2. $\vec{\text{a}}.\vec{\text{b}}=0=\vec{\text{c}}.\vec{\text{a}}$
  3. $\vec{\text{a}}.\vec{\text{b}}=\vec{\text{b}}.\vec{\text{c}}=\vec{\text{c}}.\vec{\text{a}}=0$
  4. $\vec{\text{b}}.\vec{\text{c}}=\vec{\text{c}}.\vec{\text{a}}=0$
→
A function f from the set of natural numbers to the set of integers defined by $\text{f(n)}\begin{cases}\frac{\text{n}-1}{2},&\text{when n is odd}\\-\frac{\text{n}}{2},&\text{when n is even}\end{cases}$ is:
  1. Neither one-one nor onto.
  2. One-one but not onto.
  3. Onto but not one-one.
  4. One-one and onto.
→
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
→
If $\text{A}=\frac{1}{3}\begin{bmatrix} 1 & 1 & 2 \\ 2 & 1 & -2 \\ \text{x} & 2 & \text{y} \end{bmatrix}$ is prthogonal, than x + y =
  1. 3
  2. 0
  3. -3
  4. 1
→
If $A$ and $B$ are two matrices such that $AB = B$ and $BA = A, A^2 + B^2$ is equal to$:$
→