Operation Research - Quiz 2

The ________ is an iterative procedure for finding the optimal solution to a linear programming problem.

• Transportation

• Assignment 

• Simulation

• Simplex

The Simplex method simply selects the optimal solution amongst the set of _______ of the problem.

• Infeasible solution

• Infeasible boundary

• Feasible solution

• None of these

Introduce slack variables for ___________ type of constraint.

• ≥

• ≤

• π

• ∞

   

Introduce any artificial variable for ____________ type of constraint.

• ≤

• ≥

• ≠

• =

Introduce surplus variables and _____________ variable for _____________ type of constraint.

• Artificial, ≠                           

• Slack, ≤                        

• Artificial, ≥

• Slack, ≥

The introduction of slack and surplus variable ________ the equations of constraints or the objective function.

• alter

• does not alter

• depends on the question

• none of above

The Artificial variables ______________ the constraints.

• Do change  

• Does not change

•        May change           

• None of the above

The newly derived constraint equation is equivalent to the original equation, only if all the artificial variables have a value _____________.

• Zero

• One

• Between zero and one

• Less than zero

Artificial variables are incorporated into the objective function ______________  in the minimization program.

• With very large positive co-efficient

• With very small positive co-efficient

• With very large negative co-efficient

• With very small negative co-efficient

A _______________ is said to be a feasible solution if it satisfies all constraints.

• Solution

• Basic solution

• Corner point

• None of these