MCQ » Operation Research Set 2

The purpose of the stepping-stone method is to ____

Consider the linear equation 2 x1 + 3 x2 -4 x3 + 5 x4 = 10 How many basic and non-basic variables are defined by this equation?

Identify the type of the feasible region given by the set of inequalities x -y <= 1 x -y >= 2 where both x and y are positive

Both transportation and assignment problems are members of a category of LP problems called___

In graphical representation the bounded region is known as _________ region

Select the correct statement

Service mechanism in a queuing system is characterized by ______________

Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints?

In program evaluation review technique network each activity time assume a beta distribution because______________

The net cost of shipping one unit on a route not used in the current transportation problem solution is called the___

If any value in XB column of final simplex table is negative, then the solution is ______________

Graphical optimal value for Z can be obtained from____

With the transportation technique, the initial solution can be generated in any fashion one chooses. The only restriction is that ___

Minimize Z = ______________

In graphical method the restriction on number of constraint is __________

The difference between total float and head event slack is ______________

To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______________

The objective of network analysis is to______________

A feasible solution to a linear programming problem ______________

What is the difference between minimal cost network flows and transportation problems?

Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following vectors are linearly independent?

For any primal problem and its dual______________

_____occurs when the number of occupied squares is less than the number of rows plus

Hungarian Method is used to solve____

The objective function for a minimization problem is given by z = 2 x1 -5 x2 + 3 x3 The hyperplane for the objective function cuts a bounded feasible region in the space (x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.