The objective function of a linear programming problem is: 1. A c… - Vidyadip

Question

The objective function of a linear programming problem is:

A constraint
Function to be optimised
A relation between the variables
None of these

✓

Answer

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

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 system of vectors i, j, k is:

Orthogonal
Collinear
Coplana
None of these

For what value of x, the matrix $A=\left[\begin{array}{rrr}0 & 1 & -2 \\ -1 & 0 & 3 \\ x & -3 & 0\end{array}\right]$ is skew-symmetric matrix?

Find the absolute maximum value of $f(x)=4 x-\frac{1}{2} x^2$ in interval $\left[-2, \frac{9}{2}\right]$.

The general solution of the differntial equation $\frac{\text{dy}}{\text{dx}}+\text{y}\cot\text{x}=\text{coses}\ \text{x}$ is:

$\text{x}+\text{y}\sin\text{x}=\text{C}$
$\text{x}+\text{y}\cos\text{x}=\text{C}$
$\text{y}+\text{x}(\sin\text{x}+\cos\text{x})=\text{C}$
$\text{y}\sin\text{x}=\text{x}+\text{C}$

If matrix $A=\left[a_{i j}\right]_{m \times n}$ is a square matrix, then

The area of the region bounded by the curve $y=x^2$ and line $y=4$ is:

The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is:

p = q
p = 2q
q = 2p
q = 3p

Choose the correct answer from the given four options.
Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is:

Reflexive but not symmetric.
Reflexive but not transitive.
Symmetric and transitive.
Neither symmetric, nor transitive.

Which of the following is a type of Linear programming problem?

$\int\limits^1_0\sqrt{\text{x}(1-\text{x})}\text{ dx}$ equals:

$\frac{\pi}{2}$
$\frac{\pi}{4}$
$\frac{\pi}{6}$
$\frac{\pi}{8}$