Test: Simplex Method & Transportation Model - 1 - Mechanical Engineering MCQ

The supply at three sources is 50, 40 and 60 units respectively whilst the demand at the four destinations is 20, 30, 10 and 50 units. In solving this transportation problem  

Consider the Linear Programme (LP) 
Maximize 4x + 6y
subject to 3x + 2y ≤  6
2x + 3y ≤ 6
x, y ≥ 0

Q. 

After introducing slack variables s and t, the initial basic feasible solution is represented by the tableau below (basic variables are s = 6 and t = 6, and the objective function value is 0).  

After some simplex iteration, the following tableau is obtained

From this, one can conclude that 

Consider the Linear Programme (LP) 
Maximize 4x + 6y
subject to 3x + 2y ≤  6
2x + 3y ≤ 6
x, y ≥ 0

Q. 

The dual for the LP in Q 2 is: 

A company has two factories S1, S2 and two warehouses D1, D2. The supplies from S1 and S2 are 50 and 40 units respectively. Warehouse D1 requires a minimum of 20 units and a maximum of 40 units. Warehouse D2 requires a minimum of 20 units and, over and above, it can take as much as can be supplied. A balanced transportation problem is to be formulated for the above situation. The number of supply points, the number of demand points, and the total supply (or total demand) in the balanced transportation problem respectively are:      

Which one of the following subroutines does a computer implementation of the simplex routine require? 

A firm is required to procure three items (P, Q, and R). The prices quoted for these items (in Rs.) by suppliers S1, S2 and S3 are given in table. The management policy requires that each item has to be supplied by only one supplier and one supplier supply only one item. The minimum total cost (in Rs.) of procurement to the firm is:

In the solution of linear programming problems by Simplex method, for deciding the leaving variable 

In order for a transportation matrix which has six rows and four columns, not to be degenerate, how much must be the number of allocated cells in the matrix? 

A tie for leaving variables in simplex procedure implies: 

Consider the following statements:

The assignment problem is seen to be the special case of the transportation problem in which 1. m = n
2. All a_i =  1  
3. x_ij = 1
(The symbols have usual meaning)

Which of the statements given above are correct?   

Match List-I (Persons with whom the models are associated) with List-II (Models) and select the correct answer:

Which one of the following is not the solution method of transportation problems?