Paper Tayyari

Lecture 25: Two Phase Method

MCQs, short and long questions from lecture 25.Lecture 25 ki MCQs, short aur long sawal.

5 MCQs · 5 MCQs from past papers5 MCQs · 5 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/5
– correctsahi
1.
★ Final term 2012

By using Two phase method to solve a linear programming problem, in phase I, a new objective function is formed by assigning on left hand side, zero to every original variable (including slack and surplus variables) and -------- to each of the artificial variables.

  1. AM
  2. B−M
  3. C+1
  4. D−1

The Phase I objective (maximize form) gives cost 0 to original variables and −1 to each artificial variable, i.e. Max Z* = −ΣA; M is used only in the Big M method.

2.
★ Final term 2012

For the linear programming problem; Max Z = 2x + 3y Subject to x ≥ 2, y ≤ 3, x, y ≥ 0 ⇒ x − s1 + A = 2, y + s2 = 3, x, y, s1, s2, A ≥ 0. Which of the following is associated objective function of the 1st phase?

  1. AMax Z = 2x + 3y + A
  2. BMin Z = 2x + 3y + A
  3. CMax Z = A
  4. DMin Z = A

Phase I minimizes the sum of the artificial variables, here only A.

3.
★ Final term paper (screens, paper 2)

Min. Z = 0 and no artificial variable appears in the basic variables. ____ solution to original problem has been found and we proceed to phase II method.

  1. AA basic feasible
  2. BAn optimal
  3. CAn infeasible

Phase I ending with Z = 0 and no artificials in the basis gives a basic feasible solution to start Phase II.

4.
★ Final term paper (screens, paper 2)

If the problem has a ____ solution such that the minimum value of the objective function is zero along with zero values of artificial variables. Then proceed to phase II method.

  1. Aunbounded
  2. Bfeasible
  3. Cnon feasible
  4. Dde-generate feasible solution

Phase I with minimum zero and all artificials zero means a feasible solution exists, so Phase II follows.

5.
★ Final term Fall 2005

The Phase-I objective function Minimize R0 = sum_{i=1}^{n} R_i, where R_i are artificial variables is obtained by

  1. ADividing the Big-M method's objective function by 'M' and then dropping the negligible terms
  2. BDividing the Big-M method's objective function by '-M' and then dropping the negligible terms
  3. CMultiply the Big-M method's objective function by 'M' and then dropping the negligible terms
  4. DMultiply the Big-M method's objective function by '-M' and then dropping the negligible terms

Dividing Min Z = sum cx + M sum R by M and letting M grow leaves only sum R, the Phase-I objective.