In an LP problem, to evaluate the basic variables in Simplex method, which of the following method is used?

• A) Gauss Elimination method
• B) Gauss-Seidel method
• C) Gauss Least Square method
• D) Gauss-Jordan method

Shortcoming of Big M method is that the value of M could be ____________.

• A) negative
• B) very large
• C) positive
• D) very small

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

• A) non-basic feasible
• B) basic feasible
• C) optimal
• D) degenerate

For $Z = 4 x_1 + x_2$ subject to $3 x_1 + 4 x_2 \geq 20, x_1 + 5 x_2 \geq 15$, we have ___________ variables.

• A) six
• B) one slack
• C) three objective
• D) two artificial

Big M technique is used if the initial basic solution obtained using slack variables is _______.

• A) inconsistent
• B) feasible
• C) optimal
• D) infeasible

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 it is ---------- solution.

• A) degenerate infeasible
• B) non-degenerate infeasible
• C) degenerate feasible
• D) non-degenerate feasible

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

• A) artificial
• B) non-basic
• C) basic
• D) decision

In a feasible region, if the end points of the line segment are basic solutions, then all the points between these two will ------------.

• A) be non basic
• B) be optimal
• C) also be the basic
• D) be infeasible

Convex set is the collection of all -------------.

• A) feasible solutions
• B) optimal solutions
• C) non-feasible solutions
• D) negative solutions

While solving a Linear programming problem, we find -------------number of basic feasible solution.

• A) odd
• B) infinite
• C) only finite
• D) even

An optimal solution of a Linear Programming problem is necessarily a Basic feasible solution.

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

Which of the following is true about the inclusion of non-negative slack variable into a constraint of type ‘less than or equal’?

• A) Inequality is transformed into type: ‘greater than or equal’
• B) Inequality is transformed into strict equality constraint
• C) This inclusion doest not affect the inequality
• D) Inequality become redundant and hence skips from the LP problem.

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?

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

By Simplex method, to minimize ‘Z = 2x+9y’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?

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

After converting constraints into the respective Standard equalities, we have an LP problem of ‘4’ equations in ‘6’ variables. Then how many Combinations of Basic feasible Solutions may possible?

• A) 10
• B) 15
• C) 24
• D) 2

A Linear Programming problem may not have any feasible solution.

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

Which of the following order pair would minimize the objective function of the linear programming problem; $z = x + 5 y$ subject to $x \geq 2 , y \geq 0$ ?

• A) (2,0)
• B) (2,3)
• C) (0,0)
• D) (0,3)

If the optimum solution of a Linear Programming problem is finitely unique and then its corresponding objective function must have------------ maximum or minimum.

• A) NO
• B) infinite
• C) finite
• D) arbitrary

If any or all of the artificial variables do not leave the basis in the final solution, then this indicates that the problem _________ .

• A) may have a solution
• B) non of these
• C) does not have a solution
• D) must have a solution

In the Simplex method to solve an LP problem of maximization, if at the end of iteration, every entry of objective function row is positive then the given problem------------.

• A) has no solution
• B) can not be optimized
• C) needs further improvement
• D) has been maximized