Jobs By Abekus

Operational-research Questions Set 2:

Quiz Mode

In a transportation problem with 4 supply points and 5 demand points, how many constraints are required in its formulation?

Solution:

What type of model is created by operations research to solve a given problem?

Scientific Model

Economic Model

Mathematical Model

Machine Model

Solution:

What problem is the Hungarian method used to solve?

a transportation problem

an assignment problem

an LP problem

both assignment and transportation problems

Solution:

Which of the following is not a technique used for long-range forecasting?

Market research and market survey

Delphi method

Collective opinion

Correlation and regression

Solution:

Which of the following methods is commonly used to solve assignment problems?

Stepping stone method

Hungarian method

North-west corner method

Vogel's approximation method

Solution:

In a network, the flow between sources and sinks must be equal to the capacity of which of the following?

Cut

Minimal cut

Both cut and minimal cut

Either cut or minimal cut

Solution:

Consider a variable Z in Linear Programming. Which of the following relation is true for Z?

Minimize(Z) = -Maximize(Z)

Minimize(Z) = -Maximize(-Z)

None of these

Solution:

While solving a linear programming model, if a redundant constraint is added, what will be its effect on the existing solution?

There will be no effect

The solution space will get further constrained

The solution space becomes concave

The problem no longer remains solvable

Solution:

Which one of the following statements is true about the simplex method of linear programming?

The constants of constraints equation may be positive or negative

Inequalities are not converted into equations

It cannot be used for two-variable problems

The simplex algorithm is an iterative procedure

Solution:

For the standard transportation linear program with m sources and n destinations and total supply equals total demand, an optimal solution (lowest cost) with the smallest number of non-zero xij values (amounts from source i to destination j) is desired. What will be the best upper bound for this number?

m + n

m + n - 1

2(m + n)

Operational-research Questions Set 2:

In a transportation problem with 4 supply points and 5 demand points, how many constraints are required in its formulation?

Solution:

What type of model is created by operations research to solve a given problem?

Solution:

What problem is the Hungarian method used to solve?

Solution:

Which of the following is not a technique used for long-range forecasting?

Solution:

Which of the following methods is commonly used to solve assignment problems?

Solution:

In a network, the flow between sources and sinks must be equal to the capacity of which of the following?

Solution:

Consider a variable Z in Linear Programming. Which of the following relation is true for Z?

Solution:

While solving a linear programming model, if a redundant constraint is added, what will be its effect on the existing solution?

Solution:

Which one of the following statements is true about the simplex method of linear programming?

Solution:

Solution:

Related Question Sets:

Related Topics: