Indian Mathematical Models for Transportation

Description: This quiz is designed to test your knowledge of Indian Mathematical Models for Transportation. These models are used to optimize the movement of people and goods, and they have been developed by Indian mathematicians over the years.
Number of Questions: 15
Created by:
Tags: indian mathematics transportation mathematical models
Attempted 0/15 Correct 0 Score 0

Which Indian mathematician is known for his work on the transportation problem?

  1. V. K. Murthy

  2. S. S. Rao

  3. K. G. Ramakrishnan

  4. P. K. Gupta


Correct Option: A
Explanation:

V. K. Murthy is an Indian mathematician who is known for his work on the transportation problem. He developed a method for solving the transportation problem that is known as the Murthy method.

What is the objective of the transportation problem?

  1. To minimize the total cost of transportation

  2. To maximize the total profit from transportation

  3. To minimize the total time of transportation

  4. To maximize the total distance of transportation


Correct Option: A
Explanation:

The objective of the transportation problem is to minimize the total cost of transportation. This is done by finding the optimal routes for transporting goods from sources to destinations.

Which of the following is a constraint in the transportation problem?

  1. The total supply of goods must be equal to the total demand for goods

  2. The cost of transportation between each source and destination must be the same

  3. The quantity of goods transported between each source and destination must be non-negative

  4. The total distance of transportation must be less than a certain value


Correct Option: A
Explanation:

One of the constraints in the transportation problem is that the total supply of goods must be equal to the total demand for goods. This ensures that all of the goods are transported to their destinations.

Which of the following is a method for solving the transportation problem?

  1. The simplex method

  2. The Vogel's approximation method

  3. The north-west corner method

  4. The least cost method


Correct Option: A
Explanation:

The simplex method is a method for solving the transportation problem. It is a general-purpose method that can be used to solve a variety of linear programming problems.

What is the Vogel's approximation method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: A
Explanation:

The Vogel's approximation method is a method for finding an initial feasible solution to the transportation problem. It is a heuristic method that is not guaranteed to find the optimal solution, but it can often find a good solution quickly.

What is the north-west corner method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: A
Explanation:

The north-west corner method is a method for finding an initial feasible solution to the transportation problem. It is a simple method that is easy to apply, but it does not always find the optimal solution.

What is the least cost method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: B
Explanation:

The least cost method is a method for finding the optimal solution to the transportation problem. It is a systematic method that guarantees to find the optimal solution, but it can be computationally expensive.

Which of the following is an application of the transportation problem?

  1. Scheduling of vehicles

  2. Routing of goods

  3. Assignment of jobs to machines

  4. All of the above


Correct Option: D
Explanation:

The transportation problem has a wide range of applications, including scheduling of vehicles, routing of goods, and assignment of jobs to machines.

Who developed the concept of VRP?

  1. George Dantzig

  2. J. B. Rosen

  3. P. K. Gupta

  4. S. S. Rao


Correct Option: A
Explanation:

George Dantzig developed the concept of VRP in 1959.

What is the objective of VRP?

  1. To minimize the total cost of transportation

  2. To minimize the total time of transportation

  3. To minimize the total distance of transportation

  4. To maximize the total profit from transportation


Correct Option: A
Explanation:

The objective of VRP is to minimize the total cost of transportation.

Which of the following is a constraint in VRP?

  1. The total supply of goods must be equal to the total demand for goods

  2. The cost of transportation between each source and destination must be the same

  3. The quantity of goods transported between each source and destination must be non-negative

  4. The total distance of transportation must be less than a certain value


Correct Option: A
Explanation:

One of the constraints in VRP is that the total supply of goods must be equal to the total demand for goods. This ensures that all of the goods are transported to their destinations.

Which of the following is a method for solving VRP?

  1. The simplex method

  2. The Vogel's approximation method

  3. The north-west corner method

  4. The least cost method


Correct Option: A
Explanation:

The simplex method is a method for solving VRP. It is a general-purpose method that can be used to solve a variety of linear programming problems.

What is the Vogel's approximation method for VRP?

  1. A method for finding an initial feasible solution to VRP

  2. A method for finding the optimal solution to VRP

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: A
Explanation:

The Vogel's approximation method is a method for finding an initial feasible solution to VRP. It is a heuristic method that is not guaranteed to find the optimal solution, but it can often find a good solution quickly.

What is the north-west corner method for VRP?

  1. A method for finding an initial feasible solution to VRP

  2. A method for finding the optimal solution to VRP

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: A
Explanation:

The north-west corner method is a method for finding an initial feasible solution to VRP. It is a simple method that is easy to apply, but it does not always find the optimal solution.

What is the least cost method for VRP?

  1. A method for finding an initial feasible solution to VRP

  2. A method for finding the optimal solution to VRP

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation


Correct Option: B
Explanation:

The least cost method is a method for finding the optimal solution to VRP. It is a systematic method that guarantees to find the optimal solution, but it can be computationally expensive.

- Hide questions