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

• A) 2x-3y –s +A =5
• B) 2x-3y –s =5
• C) 2x-3y +s =5
• D) 2x-3y +s + A=5

The cost coefficient of artificial variable in Objective function is -------------.

• A) 0
• B) 1
• C) M
• D) > than 1

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) three objective
• C) one artificial
• D) two slack

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,0,2), then it is ---------- solution.

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

In an LP problem, to evaluate the basic variables in Simplex method in any iteration, we would have to express Objective function in terms of ------------- variables.

• A) Artificial
• B) Basic
• C) Non-basic
• D) Slack

The purpose of phase 1 in the two phase method is to ________ .

• A) to maximize the objective function
• B) to introduce slack variables
• C) to minimize the sum of artificial variables
• D) to minimize the objective function

While solving an LP problem by Simplex method, if we have ‘3’ constraint equations in ‘5’ variables then to find basic variables we have to put any ------- variables equal to zero.

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

In graphical solution of solving Linear Programming problem to convert inequalities into
equations, we ----------------.

• A) use Artificial surplus variables
• B) use Slack variables
• C) use Surplus variables
• D) simply assume them to be equations

The straight line associated with the constraint;2x+3y<12,will meet x-axis at a distance of-------- units from origin.

• A) 3
• B) 6
• C) 2
• D) 4

Solution region of the constraints: 2x+3y>12 or 6x+9y=36, will be the half plane bisected by ‘2x+3y=12’, ----------- all the points on ‘2x+3y=12’.

• A) excluding
• B) including
• C)
• D)

The positive slack variables indicate -----------------.

• A) excess resource available
• B) nil resources
• C) shortage of resources
• D) idle(waste) resource

If in a LP problem, the objective is to maximize: z = 2x+3y, with all associated constraints of ‘=<’ type, then in the 1st iteration, z = ---------.

• A) 6
• B) 0
• C) 5
• D) 1

For a LP say;‘Min:z = x+y’ under the constraints x,y>=0, the optimal solution would be--------.

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

In the Two Phase Method the objective of Phase 2 is to _____________.

• A) maximize the original objective function
• B) maximize the artificial variables
• C) find the optimum basic solution for the original problem
• D) minimize the original objective function

In the Simplex method to solve an LP problem of minimization, if at the end of iteration, there is a positive coefficient in the objective row then the given problem -------------.

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

The first step in the 'Big M' technique is ________________.

• A) identifying the objective function coefficients
• B) introducing artificial variables for constraints involving “≥”
• C) None of these
• D) expressing the linear programming problem in equation form

When using Big M method, the objective function should not contain __________ variable(s).

• A) slack
• B) $x_1$
• C) artificial and slack
• D) artificial

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.

• A) zero
• B) strictly positive
• C) maximum or minimum
• D) strictly negative

When constraints are of greater than or equal to type, then we ______________.

• A) non of these
• B) both of these
• C) subtract slack variable and add artificial variable
• D) add slack variable and subtract artificial varialbe

Which of the following will be annual optimum cost of a product if the number of annual orders WITHOUT any shortage is 25 and the total cost of one cycle is 10,000?

• A) Rs. 10025
• B) Rs.400
• C) Rs. 250000
• D) Rs.9975