GATE Mechanical 2014 Set 3 | Question: 39

Question

Follow @csegate

GO

GATE Mechanical 2014 Set 3 | Question: 39

Please log in or register to answer this question.

← Prev Question Next Question →

← Prev. Qn. in Cat. Next Qn. in Cat. →

Related questions

0 votes

0 answers

GATE Mechanical 2014 Set 3 | Question: 5
The definite integral $\int_{1}^{3}\dfrac{1}{x}$ is evaluated using Trapezoidal rule with a step size of $1$. The correct answer is _______

The definite integral $\int_{1}^{3}\dfrac{1}{x}$ is evaluated using Trapezoidal rule with a step size of $1$. The correct answer is _______

asked Feb 19, 2017 in Numerical Methods Arjun 24.6k points

0 votes

0 answers

GATE2017 ME-2: 51
Maximise $Z=5x_{1}+3x_{2}$ subject to $\begin{array}{} x_{1}+2x_{2} \leq 10, \\ x_{1}-x_{2} \leq 8, \\ x_{1}, x_{2} \geq 0 \end{array}$ In the starting Simplex tableau, $x_{1}$ and $x_{2}$ are non-basic variables and the value of $Z$ is zero. The value of $Z$ in the next Simplex tableau is _______.

Maximise $Z=5x_{1}+3x_{2}$ subject to $\begin{array}{} x_{1}+2x_{2} \leq 10, \\ x_{1}-x_{2} \leq 8, \\ x_{1}, x_{2} \geq 0 \end{array}$ In the starting Simplex tableau, $x_{1}$ and $x_{2}$ are non-basic variables and the value of $Z$ is zero. The value of $Z$ in the next Simplex tableau is _______.

asked Feb 27, 2017 in Numerical Methods Arjun 24.6k points

0 votes

0 answers

GATE Mechanical 2014 Set 3 | Question: 19
The actual sales of a product in different months of a particular year are given below: ... $4$-month moving average method, for the month of February is _______

The actual sales of a product in different months of a particular year are given below: ... $4$-month moving average method, for the month of February is _______

asked Feb 19, 2017 in Materials, Manufacturing and Industrial Engineering Arjun 24.6k points

0 votes

0 answers

GATE2015-3-51
For the linear programming problem: $\begin{array}{ll} \text{Maximize} & Z = 3X_1 + 2X_2 \\ \text{Subject to} &−2X_1 + 3X_2 \leq 9\\ & X_1 − 5 X_2 \geq −20 \\ & X_1, X_2 \geq 0 \end{array}$ The above problem has unbounded solution infeasible solution alternative optimum solution degenerate solution

For the linear programming problem: $\begin{array}{ll} \text{Maximize} & Z = 3X_1 + 2X_2 \\ \text{Subject to} &−2X_1 + 3X_2 \leq 9\\ & X_1 − 5 X_2 \geq −20 \\ & X_1, X_2 \geq 0 \end{array}$ The above problem has unbounded solution infeasible solution alternative optimum solution degenerate solution

asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points

0 votes

0 answers

GATE2018-2-35
The problem of maximizing $z=x_1-x_2$ subject to constraints $x_1+x_2 \leq 10, \: x_1 \geq 0, x_2 \geq 0$ and $x_2 \leq 5$ has no solution one solution two solutions more than two solutions

The problem of maximizing $z=x_1-x_2$ subject to constraints $x_1+x_2 \leq 10, \: x_1 \geq 0, x_2 \geq 0$ and $x_2 \leq 5$ has no solution one solution two solutions more than two solutions

asked Feb 17, 2018 in Numerical Methods Arjun 24.6k points

Log In

Register

Recent Posts

GATE Mechanical 2014 Set 3 | Question: 39

Please log in or register to answer this question.

0 Answers

Related questions