ACTIVITY I

A constraint of the type ≤ can be converted into an equation by adding a ______variable to the left side of

the constraint

• slack

• surplus

• decision

Simplex methods is a technique of solving

• Transportation problem

• Assignment problem

• Linear Programming Problem

• Inventory Problems

When the max value of Z occurs at the point of infinity then the LPP is said to have

• optimum solution

• unbounded solution

• bounded solution

• no solution

OR is concerned with the concept of

• Optimization

• Minimization

• Maximization

• no solution

The method used to find the optimal solution for a transportation problem is

• LCM

• VAM

• NWCR

• MODI

Vogel’s Approximation method is otherwise called as

• Modified method

• Alternative method

• Penalty method

LCM is otherwise known as

• Stepping stone

• Matrix Minima method

• Row Minimum method

• Column Minimum method

There are ____ methods for finding the initial basic feasible solution for a TP

• 2

• 4

• 5

• 3

The earliest start and earliest finish times for each activity is obtained from

• Forward Pass calculations

• Backward Pass calculations

• Time estimate

A path from the first node to the last node comprising only of critical activities is called

• optimal path

• critical path

• a shortest path

• Normal path