Courses

# Simplex Method And Transportation Model - MCQ Test 2

## 25 Questions MCQ Test Mock Test Series - Mechanical Engineering (ME) for GATE 2020 | Simplex Method And Transportation Model - MCQ Test 2

Description
This mock test of Simplex Method And Transportation Model - MCQ Test 2 for Mechanical Engineering helps you for every Mechanical Engineering entrance exam. This contains 25 Multiple Choice Questions for Mechanical Engineering Simplex Method And Transportation Model - MCQ Test 2 (mcq) to study with solutions a complete question bank. The solved questions answers in this Simplex Method And Transportation Model - MCQ Test 2 quiz give you a good mix of easy questions and tough questions. Mechanical Engineering students definitely take this Simplex Method And Transportation Model - MCQ Test 2 exercise for a better result in the exam. You can find other Simplex Method And Transportation Model - MCQ Test 2 extra questions, long questions & short questions for Mechanical Engineering on EduRev as well by searching above.
QUESTION: 1

Solution:
QUESTION: 2

Solution:
QUESTION: 3

### A simplex table for a linear programming problem is given below: Which one of the following correctly indicates the combination of entering and leaving variables?

Solution:

The combination of entering and leaving variables corresponds to Z being minimum and maximum value of row in table.

QUESTION: 4

Consider the following statements on transportation problem:

1. In Vogel's approximation method, priority allotment is made in the cell with lowest cost in the column or row with least penalty
2. The North-West corner method ensures faster optimal solution
3. If the total demand is higher than the supply, transportation problem cannot be solved
4. A feasible solution may not be an optimal solution.

Which of these statements are correct?

Solution:
QUESTION: 5

In the solution of a linear programming problem by Simplex method, if during iteration, all ratios of right-hand side bi to the coefficients of entering variable a are found to be negative, it implies that the problem has

Solution:
QUESTION: 6

In a connected network of 'n' arcs (roads) joining 'm' vertices (towns), a selection of roads is taken up for resurfacing based on a minimum spanning tree of network as being the least cost solution. This spanning tree will contain

Solution:

Spanning tree will have m + n - 1 acrs

QUESTION: 7

While solving a linear programming problem by simplex method, if all ratios of the right-hand side (bi) to the coefficient, in the key row (aij) become negative, then the problem has which of the following types of solution?

Solution:

While solving a linear programming problem by simplex method, if all the ratios of the right hand side (bi) to the coefficient in the key row (aij) become negative, it means problem is having unbounded solution.

QUESTION: 8

Assertion (A): In the solution of transportation problem, for application of optimality test, the number of allocations required is m + n – 1 and these should be in independent positions.

Reason (R): If the number of allocations is not m + n – 1, values of all oddments, i.e., ui and vj cannot be found.

Solution:
QUESTION: 9

A linear programming problem with mixed constraints (some constraints of ≤ type and some of ≥ type) can be solved by which of the following methods?

Solution:

A linear programming problem with mixed constraints (some constraints of  ≤ type and some of ≥ type) can be solved by Big M-method which involves.
(i) Objective function should be changed to maximization function.
(ii) If the constraint is ≥ type, along with a slack variable an artificial variable is also used.

QUESTION: 10

In a transportation problem North-West corner rule would yield

Solution:
QUESTION: 11

Consider the following statements:

1. A linear programming problem with three variables and two constraints can he solved by graphical method.
2. For solutions of a linear programming problem with mixed constraints. Big-M-method can be employed.
3. In the solution process of a linear programming problem using Big-M-method, when an artificial variable leaves the basis, the column of the artificial variable can be removed from all subsequent tables.

Which one these statements are correct?

Solution:
QUESTION: 12

Assertion (A): Vogel's approximation method yields the best initial basic feasible solution of a transportation problem.

Reason (R): Vogel's method gives allocations to the lowest cost elements of the whole matrix.

Solution:
QUESTION: 13

When solving the problem by Big-M method, if the objective functions row (evaluation row) shows optimality but one or more artificial variables are still in the basis, what type of solution does it show?

Solution:

When solving the problem by Big-M method if the objective functions row (evaluation row) shows optimality but one or more artificial variables are still in the basis, this shows infeasible solution.

QUESTION: 14

In a transportation problem, the materials are transported from 3 plants to 5 warehouses. The basis feasible solution must contain exactly, which one of the following allocated cells?

Solution:
QUESTION: 15

Which one of the following statements is not correct?

Solution:
QUESTION: 16

When there are 'm' rows and 'n' columns in a transportation problem, degeneracy is said to occur when the number of allocations is:

Solution:
QUESTION: 17

A solution is not a basic feasible solution in a transportation problem if after allocations.

Solution:
QUESTION: 18

In order for a transportation matrix which has six rows and four columns not to degenerate, what is the number of occupied cells in the matrix?

Solution:
QUESTION: 19

Match List-I (O.R. Techniques) with List-II (Application) and select the correct answer using the codes given below the lists:  Solution:
QUESTION: 20

Assertion (A): Transportation problem can be solved by VAM heuristic much faster as compared to the solution through linear programming method.

Reason (R): VAM heuristic gives an approximate solution. It is checked for optimality test. If it is optimal, the algorithm stops there. If it is not an optimal solution, then improved solutions are found out through very little iteration till optimality is reached.

Solution:
QUESTION: 21

Assertion (A): In distribution problem, unit cost of production as well as transportation cost is considered.

Reason (R): The Vogel approximation method can reduce the number of iterations required to move from the initial assignment to the optimal solution.

Solution:

Both A and R are true and R is not correct explanation for A

QUESTION: 22

In a 6 × 6 transportation problem, degeneracy would arise, if the number of filled slots were:

Solution:
QUESTION: 23

The solution in a transportation model (of dimension m × n) is said to be degenerate if it has

Solution:
QUESTION: 24

Consider the following statements:

In a transportation problem, North-West corner method would yield
1. An optimum solution
2. An initial feasible solution
3. Vogel's app roximat e solution

Of these statements:

Solution:

Statement 2 alone is correct

QUESTION: 25

Consider the location of a warehouse to distribute books for the cities of Bombay, Bangalore and Calcutta. The estimated volume of distribution to Bombay, Bangalore and Calcutta are 55,000, 20,000 and 25,000 units respectively. Using some appropriate origin, the (x, y) co-ordinates of Bombay, Bangalore and Calcutta can be approximated as (10, 20), (20, 10) and (30, 30) respectively. The (x, y) co-ordinates or the optimal location would be:

Solution: 