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

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