Register

GATE2016-1-5

• recategorized by

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →
Answer:

Related questions

0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2016-3-5
The root of the function $f(x) = x^3+x-1$ obtained after first iteration on application of Newton-Raphson scheme using an initial guess of $x_0=1$ is $0.682$ $0.686$ $0.750$ $1.000$
The root of the function $f(x) = x^3+x-1$ obtained after first iteration on application of Newton-Raphson scheme using an initial guess of $x_0=1$ is$0.682$$0.686$$0.750$...
0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2016-1-29
Gauss-Seidel method is used to solve the following equations (as per the given order): $x_1+2x_2+3x_3=5$ $2x_1+3x_2+x_3=1$ $3x_1+2x_2+x_3=3$ Assuming initial guess as $x_1=x_2=x_3=0$ , the value of $x_3$ after the first iteration is __________
Gauss-Seidel method is used to solve the following equations (as per the given order):$x_1+2x_2+3x_3=5$$2x_1+3x_2+x_3=1$$3x_1+2x_2+x_3=3$Assuming initial guess as $x_1=x_...
0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2015-3-43
Newton-Raphson method is used to find the roots of the equation, $x^3+3x^2+3x-1=0$. If the initial guess is $x_0=1$, then the value of $x$ after $2^{nd}$ iteration is ________
Newton-Raphson method is used to find the roots of the equation, $x^3+3x^2+3x-1=0$. If the initial guess is $x_0=1$, then the value of $x$ after $2^{nd}$ iteration is ___...
0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2016-1-55
Maximize $Z = 15X_1 + 20X_2$ subject to $\begin{array}{l} 12X_1 + 4X_2 \geq 36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$ The above linear programming problem has infeasible solution unbounded solution alternative optimum solutions degenerate solution
Maximize $Z = 15X_1 + 20X_2$ subject to $$\begin{array}{l} 12X_1 + 4X_2 \geq 36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$$The above linear programming pr...
Voting & Accepting an answer helps improve the community
Link Copied!