\(3\sqrt 5\)
\(4\)
\(\frac {16}{9}\)
\(\frac {10}{3}\)
\(Δ=\begin{vmatrix} 8 & 1 & 4 \\[0.3em] 1 & 1 & 1 \\[0.3em] λ & -3 & 0 \end{vmatrix}\)
\(=8(3)−1(−λ)+4(−3−λ)\)
\(=24+λ–12–4λ\)
\(=12–3λ\)
So for \(λ = 4\), it is having infinitely many solutions.
\(Δ_x= \begin{vmatrix} -2 & 1 & 4 \\[0.3em] 0 & 1 & 1 \\[0.3em] μ & -3 & 0 \end{vmatrix}\)
\(Δ_x=−2(3)−1(−μ)+4(−μ)\)
\(Δ_x=−6–3μ\)
\(Δ_x=0\)
For \(μ= –2\)
Distance of \((4,−2,−\frac 12)\) from \(8x+y+4z+2=0\)
\(=\frac {32−2−2+2}{\sqrt {64+1+16}}\)
\(=\frac {10}{3}\) units
So, the correct option is (D): \(\frac {10}{3}\)
The objective function of L.L.P. defined over the convex set attains its optimum value at
A body of mass 1000 kg is moving horizontally with a velocity of 6 m/s. If 200 kg extra mass is added, the final velocity (in m/s) is:
The Linear Programming Problems (LPP) is a problem that is concerned with finding the optimal value of the given linear function. The optimal value can be either maximum value or minimum value. Here, the given linear function is considered an objective function. The objective function can contain several variables, which are subjected to the conditions and it has to satisfy the set of linear inequalities called linear constraints.
Step 1: Establish a given problem. (i.e.,) write the inequality constraints and objective function.
Step 2: Convert the given inequalities to equations by adding the slack variable to each inequality expression.
Step 3: Create the initial simplex tableau. Write the objective function at the bottom row. Here, each inequality constraint appears in its own row. Now, we can represent the problem in the form of an augmented matrix, which is called the initial simplex tableau.
Step 4: Identify the greatest negative entry in the bottom row, which helps to identify the pivot column. The greatest negative entry in the bottom row defines the largest coefficient in the objective function, which will help us to increase the value of the objective function as fastest as possible.
Step 5: Compute the quotients. To calculate the quotient, we need to divide the entries in the far right column by the entries in the first column, excluding the bottom row. The smallest quotient identifies the row. The row identified in this step and the element identified in the step will be taken as the pivot element.
Step 6: Carry out pivoting to make all other entries in column is zero.
Step 7: If there are no negative entries in the bottom row, end the process. Otherwise, start from step 4.
Step 8: Finally, determine the solution associated with the final simplex tableau.