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---------.

• A) (2,2)
• B) (0,0)
• C) (-4,-2)
• D) (1,2)

In two phase method process, first phase ____________ the sum of artificial variables.

• A) non of these
• B) maximize
• C) minimize
• D) maximize or minimize depending on the situation

Simplex method can only be applied to problems with two decision variables.

• A) False
• B) True
• C)
• D)

In Simplex standard table to solve an LP problem of Maximization, we choose the candidate for entering variable in-------.

• A) Constraint with most negative coefficient
• B) Objective function with most positive coefficient
• C) Objective function with most negative coefficient
• D) Constraint with most positive coefficient

In the Simplex method, if all the elements in columns of the ratio by taking the RHS of each row and dividing by the corresponding element of the key column, are equal, the situation is known as ----------

• A) Non-degeneracy
• B) Tie
• C) Degeneracy
• D) Unboundedness

In Simplex Standard table to solve an LP problem, if the ratio by taking the RHS of each row and dividing by the corresponding element of the key column is {2/3,5,1/3, -1/2}, then which of the following variable will be leaving?

• A) Variable corresponding to ‘1/3'
• B) Variable corresponding to ‘2/3’
• C) Variable corresponding to ‘5’
• D) Variable corresponding to ‘-1/2’

If the point (6,t) lies in the feasible region associated with constraint:2x+3y>=12, then minimum value of ‘t’ would be----------.

• A) 0
• B) 4
• C) 1
• D) 3

For a LP problem say;Max:z=x+y,under the constraints x,y>=0, the feasible region would be--------.

• A) all the first quadrant
• B) point(0,0)
• C) all xy-plane
• D) empty

The role of artificial variables in the 'Big M' technique is to _______________.

• A) optimize resource allocation
• B) maximize the objective function
• C) ensure feasibility of the initial basic solution
• D) minimize the objective function

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

• A) non of these
• B) exists
• C) is uncertain
• D) does not exists

While applying Simplex method to a LP of minimization type, we proceed stepwise from one basic feasible solution to another in such a way that the objective function always ---------- its value.

• A) increases
• B) oscillate
• C) does not change
• D) decreases

By which of the following method, any complex linear programming problem can be handled?

• A) Dual method
• B) Degenerate method
• C) Simplex method
• D) Graphical method

The solution set of the constraint: 2x+3y>12, will lie in --------- bisected by the line:2x+3y=12.

• A) both half planes
• B) opposite to the origin side in half plane
• C) first quadrant only
• D) origin side of half plane

While solving a Linear Programming problem by Simplex Method, an inequality constraint is transformed into strict equality by the inclusion of ---------- variable.

• A) basic
• B) decision
• C) slack
• D) artificial

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

• A) computational procedure(Algorithm)
• B) graphical procedure
• C) probabilistic procedure
• D) analytical procedure

While solving a Linear Programming problem by Simplex method, we convert all the constraints'inequalities into------------.

• A) nothing but keep those strictly the same
• B) Equations with positive RHS
• C) opposite inequalities
• D) Equations with negative RHS

In linear programming, cycling occurs when the algorithm repeatedly follows the same sequence of iterations without converging to an optimal solution.

• A) True
• B) False
• C)
• D)

In Simplex method to solve an LP problem, Gauss Jordan Elimination method demands that all the key column entries should be zero except-----.

• A) 1st row entry
• B) last row entry
• C) row with maximum ratio on RHS column
• D) key row(pivot)entry

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?

• A) x>0
• B) x<0
• C) y<0
• D) y>0

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?

• A) x<0
• B) y<0
• C) x>0
• D) y>0