- Linear constraints
- Bottlenecks in the objective function
- Non - homogeneity
- Uncertainty
- None of the above
Solution:
For linear programming, the constraints must be linear.
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$l_1:(3+ t ) \hat{ i }+(-1+2 t ) \hat{ j }+(4+2 t ) \hat{ k },-\infty< t <\infty $
$l_2:(3+2 t ) \hat{ i }+(3+2 t ) \hat{ j }+(2+ s ) \hat{ k },-\infty< s <\infty$
Then, the coordinate$(s)$ of the point$(s)$ on $l_2$ at a distance of $\sqrt{17}$ from the point of intersection of $l$ and $l_1$ is(are)
$(A)$ $\left(\frac{7}{3}, \frac{7}{3}, \frac{5}{3}\right)$ $(B)$ $(-1,,-1,0)$ $(C)$ $(1,1,1)$ $(D)$ $\left(\frac{7}{9}, \frac{7}{9}, \frac{8}{9}\right)$
$(A)$ $P(E)=\frac{4}{5}, P(F)=\frac{3}{5}$
$(B)$ $P(E)=\frac{1}{5}, P(F)=\frac{2}{5}$
$(C)$ $P(E)=\frac{2}{5}, P(F)=\frac{1}{5}$
$(D)$ $P(E)=\frac{3}{5}, P(F)=\frac{4}{5}$