MTH601 Quiz 3

Q1. The Simplex method is a-------------- for solving Linear Programming problem.

1. computational procedure(Algorithm)
2. graphical procedure
3. analytical procedure
4. probabilistic procedure

Correct answer: computational procedure(Algorithm)

Q2. While solving a Linear Programming problem by Simplex Method, an inequality says:‘2x-3y>5’ is transformed into strict equality of the form---------, where ‘s>=0’

1. 2x-3y –s =5
2. 2x-3y –s +A =5
3. 2x-3y +s + A=5
4. 2x-3y +s =5

Correct answer: 2x-3y –s +A =5

Q3. When we have \geq type constraints, then we convert it to equality constraints by introducing _______ variable(s) and solve it by __________ method.

1. slack, Big M
2. artificial, Two phase
3. artificial and slack, Big M or Two phase
4. artificial, Big M

Correct answer: artificial and slack, Big M or Two phase

Q4. In two phase method if the minimum value of objective function in the first phase is zero, then the solution of original problem _____________.

1. non of these
2. is uncertain
3. does not exists
4. exists

Correct answer: exists

Q5. After converting constraints into the respective Standard equalities, we have an LP problem of ‘4’ equations in ‘6’ variables. If the initial basic feasible solution is say;(2,4,1,2), then its corresponding non-basic solution is---------.

1. (-4,-2)
2. (2,2)
3. (1,2)
4. (0,0)

Correct answer: (0,0)

Q6. By Simplex method, to minimize ‘Z = 9x–2y’of an LP problem, if ‘z=A>0’ for the initial iteration then for its next improved solution(0<A<100), which of the following would be the next entering variable?

1. x>0
2. y<0
3. x<0
4. y>0

Correct answer: y>0

Q7. The inequality 3x - 2y \geq 14 is equivalent to______.

1. 3x - 2y 14
2. 3x - 2y < - 14
3. - 3x + 2y > 14
4. - 3x + 2y - 14

Correct answer: - 3x + 2y - 14

Q8. In the Simplex method to solve an LP problem, Gauss Jordan Elimination method demands that all the key column's entries should be --------- except key row(pivot) entry.

1. strictly positive
2. strictly negative
3. zero
4. maximum or minimum

Correct answer: zero

Q9. By Simplex method, to maximize ‘Z = 2x–9y’of an LP problem, if ‘z=0’ for the initial iteration then for its next improved solution, which of the following would be the next entering variable?

1. y>0
2. y<0
3. x>0
4. x<0

Correct answer: x>0

Q10. While solving an LP problem by Simplex method, the inclusion of slacks in the constraints’ inequalities helps in finding ------------- variables.

1. basic
2. non-basic
3. artificial
4. decision

Correct answer: basic