Operations Research Algorithms In Linear Programming Transportation Modelling And Assignment Modelling

1. Match the following.

Ax + By + Cz + . . .≤ N

Letter "U" is designated at

p = 3x - 2y + 4z

Letter "V" is designated at

Matrix Reduction

Submit

2. Four jobs (J1, J2, J3 and J4) need to be executed by four workers (W1, W2, W3 and W4), one job per worker. The matrix below shows the cost of assigning a certain worker to a certain job.

Assign each worker to each job.

Worker 1

Worker 2

Worker 3

Worker 4

Submit

3. Is assignment model a special case of transportation model. true or false?

True

False

The assignment model is indeed a special case of the transportation model. In the assignment model, the objective is to assign a set of resources to a set of tasks, while minimizing the total cost or maximizing the total profit. This can be seen as a transportation problem, where the resources can be considered as supply points and the tasks as demand points. Therefore, the assignment model can be seen as a simplified version of the transportation model, focusing on a specific type of allocation problem.

Explanation

The assignment model is indeed a special case of the transportation model. In the assignment model, the objective is to assign a set of resources to a set of tasks, while minimizing the total cost or maximizing the total profit. This can be seen as a transportation problem, where the resources can be considered as supply points and the tasks as demand points. Therefore, the assignment model can be seen as a simplified version of the transportation model, focusing on a specific type of allocation problem.

4. Three jobs are to be assigned to Karen, David, and Pete. The cost for doing the job is given below and each person has to do one job. What will be the assignment of job to the person?

Karen

David

Pete

Submit

5. Is the objective function a linear function. true or false?

True

False

The objective function is considered a linear function when it can be expressed as a linear equation, meaning it consists only of variables that are raised to the power of 1 and are multiplied by constant coefficients. This means that the function does not contain any terms with exponents or other non-linear operations. Therefore, if the given objective function satisfies these conditions, the correct answer is true.

Explanation

The objective function is considered a linear function when it can be expressed as a linear equation, meaning it consists only of variables that are raised to the power of 1 and are multiplied by constant coefficients. This means that the function does not contain any terms with exponents or other non-linear operations. Therefore, if the given objective function satisfies these conditions, the correct answer is true.

6. In the shortest path method, you determine the minimum possible distance, true or false?

True

False

In the shortest path method, the objective is to find the minimum possible distance between two points. Therefore, the correct answer is true.

Explanation

In the shortest path method, the objective is to find the minimum possible distance between two points. Therefore, the correct answer is true.

7. Given the diagram above, match the following distances to the method used to get them.

Shortest Path Method

Maximal Flow

Minimal Spanning Tree

Submit

8. When dealing with maximal flow, your cut should come from the upper left downward. true or false?

True

False

When dealing with maximal flow, the cut should come from the upper left downward because it follows the direction of the flow. In a flow network, the upper left represents the source of the flow, and the flow is directed towards the lower right, which represents the sink. Therefore, the cut should be made in a way that separates the source from the sink, and this is achieved by cutting from the upper left downward.

Explanation

When dealing with maximal flow, the cut should come from the upper left downward because it follows the direction of the flow. In a flow network, the upper left represents the source of the flow, and the flow is directed towards the lower right, which represents the sink. Therefore, the cut should be made in a way that separates the source from the sink, and this is achieved by cutting from the upper left downward.

9. A shoe company has four factories distributing to four distribution centers. The demand for each distribution centers are 190, 250, 130, and 300 pairs. The supplies that the factories can allocate are 170, 300, 180, and 220 pairs. The cost for shipping are given below. How many pairs of shoes should be shipped from each factory to each distribution center? Use NORTHWEST-CORNER RULE.

F1 TO D1

F2 TO D1

F2 TO D2

F2 TO D3

F3 TO D3

F3 TO D4

F4 TO D4

Submit

10. Variables "X, Y, Z, . , . , are called as?

Objective variable

Subjective variable

Decision variable

None of the above

Variables "X, Y, Z, ..." are called decision variables. Decision variables are the variables that are used to represent the choices or decisions that need to be made in a mathematical model or optimization problem. These variables are typically used to represent the values that need to be determined or optimized in order to achieve the desired objective. Therefore, the correct answer is decision variable.

Explanation

Variables "X, Y, Z, ..." are called decision variables. Decision variables are the variables that are used to represent the choices or decisions that need to be made in a mathematical model or optimization problem. These variables are typically used to represent the values that need to be determined or optimized in order to achieve the desired objective. Therefore, the correct answer is decision variable.

11. What can be used to help resolve distribution and location decisions?

Transportation modelling

Assignment modelling

Network optimization

All of the above

Transportation modeling can be used to help resolve distribution and location decisions. By utilizing transportation modeling techniques, such as route optimization and capacity planning, businesses can effectively determine the most efficient and cost-effective ways to distribute their products and make location decisions. This allows them to minimize transportation costs, optimize delivery routes, and ensure timely and efficient distribution, ultimately improving overall operational efficiency and customer satisfaction.

Explanation

Transportation modeling can be used to help resolve distribution and location decisions. By utilizing transportation modeling techniques, such as route optimization and capacity planning, businesses can effectively determine the most efficient and cost-effective ways to distribute their products and make location decisions. This allows them to minimize transportation costs, optimize delivery routes, and ensure timely and efficient distribution, ultimately improving overall operational efficiency and customer satisfaction.

12. In assignment model, you determine the highest number on both the column and row and subtract it to the numbers they are aligned in.true or false?

True

False

it should be the lowest number on both column and row, not the highest one

Explanation

it should be the lowest number on both column and row, not the highest one

13. A company has two plants producing a certain product that is to be shipped to three distribution centers. The unit production costs are the same at the two plants, and the shipping cost per unit is shown below.

Shipments are made once per week. During each week, each plant produces at most 60 units and each distribution center needs at least 40 units.By using the NORTHWEST-CORNER RULE, what is the total cost?

$420

$460

$510

$560

The Northwest-Corner Rule is a method used in transportation problems to allocate shipments from sources to destinations. It starts by allocating shipments from the northwest corner (top-left) of the matrix and moves horizontally or vertically to the next available cell until all shipments are allocated. In this case, the total cost obtained using this method is $460.

Explanation

The Northwest-Corner Rule is a method used in transportation problems to allocate shipments from sources to destinations. It starts by allocating shipments from the northwest corner (top-left) of the matrix and moves horizontally or vertically to the next available cell until all shipments are allocated. In this case, the total cost obtained using this method is $460.

14. The largest or smallest value of the objective function is called?

Optimal value

Decision variable

Constraints

The optimal value refers to the largest or smallest value of the objective function in a mathematical optimization problem. It represents the best possible solution or outcome that can be achieved based on the given constraints and decision variables. The optimal value is the ultimate goal of the optimization process, as it represents the most favorable result that can be obtained.

Explanation

The optimal value refers to the largest or smallest value of the objective function in a mathematical optimization problem. It represents the best possible solution or outcome that can be achieved based on the given constraints and decision variables. The optimal value is the ultimate goal of the optimization process, as it represents the most favorable result that can be obtained.

15. In Minimal Spanning Tree, you have to start with the highest number then connect it to a lower one. true or false?

True

False

start with the least number.

Explanation

start with the least number.

16. You have to first list down the possible routes in the shortest path route then evaluate the distances before getting the answer. true or false?

True

False

The explanation for the given correct answer is that in order to determine the shortest path route, you need to list down all possible routes and then evaluate the distances between them. This process allows you to compare the distances and ultimately find the shortest path. Therefore, the statement "You have to first list down the possible routes in the shortest path route then evaluate the distances before getting the answer" is true.

Explanation

The explanation for the given correct answer is that in order to determine the shortest path route, you need to list down all possible routes and then evaluate the distances between them. This process allows you to compare the distances and ultimately find the shortest path. Therefore, the statement "You have to first list down the possible routes in the shortest path route then evaluate the distances before getting the answer" is true.

17. Maximal Flow is also called as Cutting Algorithm. true or false?

True

False

Maximal Flow is not called the Cutting Algorithm. The Cutting Algorithm is a different algorithm used to find the minimum cut in a flow network. Maximal Flow, on the other hand, is an algorithm used to find the maximum flow in a flow network. Therefore, the statement "Maximal Flow is also called the Cutting Algorithm" is false.

Explanation

Maximal Flow is not called the Cutting Algorithm. The Cutting Algorithm is a different algorithm used to find the minimum cut in a flow network. Maximal Flow, on the other hand, is an algorithm used to find the maximum flow in a flow network. Therefore, the statement "Maximal Flow is also called the Cutting Algorithm" is false.

18. Arcs represent the destinations. true or false?

True

False

Its the nodes that represent the destination

Explanation

Its the nodes that represent the destination

19. Given the diagram, if i get a total of 15 km as my distance, what kind of method did i used?

Maximal Flow

Shortest Path Method

Minimal Spanning Tree

The Shortest Path Method is used to find the shortest distance between two points in a graph or network. In this case, the person used the Shortest Path Method to calculate a total distance of 15 km. This method is commonly used in transportation and logistics to determine the most efficient route or path.

Explanation

The Shortest Path Method is used to find the shortest distance between two points in a graph or network. In this case, the person used the Shortest Path Method to calculate a total distance of 15 km. This method is commonly used in transportation and logistics to determine the most efficient route or path.

20. The letter "T" on the diagram for the algorithms of linear programming stands for "TOTAL". true or false?

True

False

its terminal meaning, the end.

Explanation

its terminal meaning, the end.

21. A problem of maximizing or minimizing a linear function (objective function) in presence of linear inequality and/or equality constraints.

Linear programming

LP

Linear optimization

All of the above

The given correct answer is "all of the above" because all three terms - linear programming, LP, and linear optimization - refer to the same problem of maximizing or minimizing a linear function in the presence of linear inequality and/or equality constraints. These terms are used interchangeably to describe the same mathematical optimization technique.

Explanation

The given correct answer is "all of the above" because all three terms - linear programming, LP, and linear optimization - refer to the same problem of maximizing or minimizing a linear function in the presence of linear inequality and/or equality constraints. These terms are used interchangeably to describe the same mathematical optimization technique.

22. The Shortest Path Route is the algorithm method where you cut the diagram to get the answer. true or false?

True

False

Its the Maximal Flow

Explanation

Its the Maximal Flow

23. Nodes represent the distances. true or false?

True

False

Its the arcs that represent the distnace

Explanation

Its the arcs that represent the distnace

24. A job has four men (A-D) available for work on four separate jobs. Only one man can work on any one job. The cost of assigning of each man to each job is given in the following table. What is the total minimum cost of assigning the four men in each job?

$58

$68

$78

$88

The total minimum cost of assigning the four men to each job is $78. This can be determined by finding the minimum cost for each job and summing them up. In this case, the minimum cost for each job is $20 (A to job 1), $18 (B to job 2), $20 (C to job 3), and $20 (D to job 4). Adding these costs together gives a total of $78.

Explanation

The total minimum cost of assigning the four men to each job is $78. This can be determined by finding the minimum cost for each job and summing them up. In this case, the minimum cost for each job is $20 (A to job 1), $18 (B to job 2), $20 (C to job 3), and $20 (D to job 4). Adding these costs together gives a total of $78.

25. When solving a transportation problem using the NORTHWEST-CORNER RULE, you start on the northeast cell of the matrix. true or false?

True

False

you start at the northwest cell not northeast cell.

Explanation

you start at the northwest cell not northeast cell.

26. In a typical assignment problem, three different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed to each job. The associated costs are as follows.

In what job would you assign machine C? state only the number representing the job.

In a typical assignment problem, three different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed for each job. The associated costs are given, but the question does not explicitly state the cost associated with machine C. However, since the question asks for the job to which machine C should be assigned, and the only available option is job number 3, the correct answer is 3.

Explanation

In a typical assignment problem, three different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed for each job. The associated costs are given, but the question does not explicitly state the cost associated with machine C. However, since the question asks for the job to which machine C should be assigned, and the only available option is job number 3, the correct answer is 3.

Submit

27. In shortest path route, you're not looking for the shortest total distance. true or false?

True

False

In the shortest path route, you are indeed looking for the shortest total distance. Therefore, the correct answer is False.

Explanation

In the shortest path route, you are indeed looking for the shortest total distance. Therefore, the correct answer is False.

28. Given the diagram below, what is the shortest path that would give the shortest distance possible?

O-C-G-T

O-B-G-F-I-T

O-A-D-H-T

O-B-F-I-T

The shortest path that would give the shortest distance possible is O-B-F-I-T. This path only includes the necessary nodes to reach the destination (T) while minimizing the distance traveled. The other paths (O-C-G-T, O-A-D-H-T, O-B-G-F-I-T) include additional nodes that are not needed to reach the destination, resulting in a longer distance.

Explanation

The shortest path that would give the shortest distance possible is O-B-F-I-T. This path only includes the necessary nodes to reach the destination (T) while minimizing the distance traveled. The other paths (O-C-G-T, O-A-D-H-T, O-B-G-F-I-T) include additional nodes that are not needed to reach the destination, resulting in a longer distance.

29. What is the second step in the Hungarian method?

Identify each column’s minimum, and subtract it from all the entries of the column.

Draw the minimum number of straight lines in the last reduced matrix that will cover all the zero entries

For the original cost matrix, identify each row’s minimum, and subtract it from all the entries of the row.

The second step in the Hungarian method is to identify each column's minimum and subtract it from all the entries of the column. This step helps in reducing the cost matrix by making the column minimums equal to zero. By subtracting the minimum value from each entry in the column, the problem of finding the optimal assignment can be simplified. This step is crucial in determining the initial assignments and finding the optimal solution in the subsequent steps of the Hungarian method.

Explanation

The second step in the Hungarian method is to identify each column's minimum and subtract it from all the entries of the column. This step helps in reducing the cost matrix by making the column minimums equal to zero. By subtracting the minimum value from each entry in the column, the problem of finding the optimal assignment can be simplified. This step is crucial in determining the initial assignments and finding the optimal solution in the subsequent steps of the Hungarian method.

30. Given the diagram, what is the optimal job assignment?

A → 1; B → 2; C → 3; D → 4; E → 5

A → 2; B → 4; C → 5; D → 1; E → 3

A → 5; B → 1; C → 3; D → 4; E → 2

A → 2; B → 5; C → 3; D → 4; E → 1

not-available-via-ai

Explanation

not-available-via-ai

31. Maximum Spanning Tree is one of the algorithms of linear programming. true or false?

True

False

The given answer is False. Maximum Spanning Tree is not an algorithm of linear programming. It is a graph algorithm used to find a spanning tree with the maximum possible total weight or cost. Linear programming, on the other hand, is a mathematical optimization technique used to find the best possible outcome in a linear mathematical model.

Explanation

The given answer is False. Maximum Spanning Tree is not an algorithm of linear programming. It is a graph algorithm used to find a spanning tree with the maximum possible total weight or cost. Linear programming, on the other hand, is a mathematical optimization technique used to find the best possible outcome in a linear mathematical model.

32. In a typical assignment problem, three different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed to each job. The associated costs are as follows.

What job should be assigned to Machine A and B ?

Machine A-Job 2 ,Machine B -Job 1

Machine B-Job 2 ,Machine C -Job 1

Machine A-Job 1 ,Machine B -Job 2

Machine A-Job 3 ,Machine B -Job 2

The correct answer is Machine A should be assigned to Job 1 and Machine B should be assigned to Job 2. This is because the associated costs for Machine A-Job 1 and Machine B-Job 2 are not given, so we cannot determine which assignment would have the lowest cost.

Explanation

The correct answer is Machine A should be assigned to Job 1 and Machine B should be assigned to Job 2. This is because the associated costs for Machine A-Job 1 and Machine B-Job 2 are not given, so we cannot determine which assignment would have the lowest cost.

33. A toy company has four factories supplying three warehouses.Factories A, B, C, and D can produce 15, 6, 14, and 11 toy cars. Warehouses 1, 2, and 3 has a demand of 19, 12, and 15 toy cars, respectively. The management wants to determine how many units of toy cars should be supplied from factory A to warehouse 1. Use the LEAST-COST METHOD.

10

6

15

4

The least-cost method is used to determine the optimal allocation of goods from multiple sources to multiple destinations based on cost. In this case, the question asks for the number of units of toy cars that should be supplied from factory A to warehouse 1. To determine this, we compare the costs of supplying from factory A to each warehouse. The cost of supplying from factory A to warehouse 1 is 15, which is the highest among all the options. Therefore, the optimal allocation is to supply 15 units of toy cars from factory A to warehouse 1.

Explanation

The least-cost method is used to determine the optimal allocation of goods from multiple sources to multiple destinations based on cost. In this case, the question asks for the number of units of toy cars that should be supplied from factory A to warehouse 1. To determine this, we compare the costs of supplying from factory A to each warehouse. The cost of supplying from factory A to warehouse 1 is 15, which is the highest among all the options. Therefore, the optimal allocation is to supply 15 units of toy cars from factory A to warehouse 1.

34. Which one is incorrect?

Transportation model is a procedure that finds the least costly means of moving products from a source to a destinations

Northeast-Corner Rule is a method of transportation modelling

Optimal value can be the smallest or largest value of the objective function

The Northeast-Corner Rule is not a method of transportation modeling. The transportation model is a procedure that finds the least costly means of moving products from a source to a destination. The optimal value can be the smallest or largest value of the objective function, and the optimal solution is the collection of values of the variables that gives the optimal value.

Explanation

The Northeast-Corner Rule is not a method of transportation modeling. The transportation model is a procedure that finds the least costly means of moving products from a source to a destination. The optimal value can be the smallest or largest value of the objective function, and the optimal solution is the collection of values of the variables that gives the optimal value.

35. You work as a sales manager for a toy manufacturer, and you currently have three salespeople on the road meeting buyers. Your salespeople are in Austin, TX; Boston, MA; and Chicago, IL. You want them to fly to three other cities: Denver, CO; Edmonton, Alberta; and Fargo, ND. The table below shows the cost of airplane tickets in dollars between these cities.

Where should you send each of your salespeople in order to minimize airfare?

Austin (Edmonton), Boston (Denver), Chicago (Fargo)

Austin (Fargo), Boston (Edmonton), Chicago (Denver)

Austin (Denver), Boston (Fargo), Chicago (Edmonton)

Austin (Edmonton), Boston (Fargo), Chicago (Fargo)

The goal is to minimize airfare, so we need to choose the routes with the lowest cost. Looking at the table, the cost of flying from Austin to Edmonton is the lowest among the options for Austin. Similarly, the cost of flying from Boston to Denver is the lowest among the options for Boston, and the cost of flying from Chicago to Fargo is the lowest among the options for Chicago. Therefore, the answer is Austin (Edmonton), Boston (Denver), Chicago (Fargo).

Explanation

The goal is to minimize airfare, so we need to choose the routes with the lowest cost. Looking at the table, the cost of flying from Austin to Edmonton is the lowest among the options for Austin. Similarly, the cost of flying from Boston to Denver is the lowest among the options for Boston, and the cost of flying from Chicago to Fargo is the lowest among the options for Chicago. Therefore, the answer is Austin (Edmonton), Boston (Denver), Chicago (Fargo).

36. Given the diagram below, find the shortest path from the origin to the terminal point.

O-A-B-E-T

O-C-E-T

O-B-C-E-T

O-A-B-D-T

The correct answer is O-A-B-D-T because it follows the path that goes through points A, B, D, and finally T, which is the terminal point. This path is the shortest because it has the fewest number of points to go through compared to the other options.

Explanation

The correct answer is O-A-B-D-T because it follows the path that goes through points A, B, D, and finally T, which is the terminal point. This path is the shortest because it has the fewest number of points to go through compared to the other options.

37. It is combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods.

Vogel's Approximation Model

Hungarian Method

Least-Cost Method

Northwest-Corner Rule

The Hungarian Method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time. It is known for its efficiency and accuracy in finding the optimal solution for the assignment problem. The method was developed by Hungarian mathematicians and was one of the earliest algorithms to solve this problem. It uses a primal-dual approach and has been widely used in various fields such as operations research, computer science, and economics.

Explanation

The Hungarian Method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time. It is known for its efficiency and accuracy in finding the optimal solution for the assignment problem. The method was developed by Hungarian mathematicians and was one of the earliest algorithms to solve this problem. It uses a primal-dual approach and has been widely used in various fields such as operations research, computer science, and economics.

38. A building firm possesses four cranes, each of which has a distance(km) from four different construction sites as shown in the table:

In which construction site will you place crane #2? State only the number representing the construction site.

Based on the information provided, crane #2 should be placed at construction site 3 because it has the shortest distance from that site compared to the other sites.

Explanation

Based on the information provided, crane #2 should be placed at construction site 3 because it has the shortest distance from that site compared to the other sites.

Submit

39. In assignment model, there is a one-to-one- correspondence. true or false?

True

False

In the assignment model, there is not a one-to-one correspondence. This model allows for multiple tasks to be assigned to a single individual or multiple individuals to be assigned to a single task. Therefore, the correct answer is false.

Explanation

In the assignment model, there is not a one-to-one correspondence. This model allows for multiple tasks to be assigned to a single individual or multiple individuals to be assigned to a single task. Therefore, the correct answer is false.

40. A company wants to transfer units from an origin to a destination. The supply that the origin can produce are 150, 120 and 130 while the demand required for the destinations are 100, 70, 140, and 90. Find the total cost using the Least-Cost Method.

14,980

14,960

14,940

15,510

not-available-via-ai

Explanation

not-available-via-ai

41. Hungarian Method involves what is called as Matrix ____________

The Hungarian Method involves what is called as Matrix Reduction. Matrix reduction is a technique used to simplify a matrix by subtracting the smallest element in each row or column from all the other elements in that row or column. This process helps in finding the optimal assignment of tasks or resources in a bipartite graph by reducing the matrix to a more manageable size. By performing matrix reduction, the Hungarian Method efficiently solves assignment problems by finding the minimum cost or maximum profit assignment.

Explanation

The Hungarian Method involves what is called as Matrix Reduction. Matrix reduction is a technique used to simplify a matrix by subtracting the smallest element in each row or column from all the other elements in that row or column. This process helps in finding the optimal assignment of tasks or resources in a bipartite graph by reducing the matrix to a more manageable size. By performing matrix reduction, the Hungarian Method efficiently solves assignment problems by finding the minimum cost or maximum profit assignment.

Submit

42. Given the table below, find the cost of assignment for each job (1-5) to each mechanic (A-E).

21

25

30

32

not-available-via-ai

Explanation

not-available-via-ai

43. Given the diagram below, find the total distance by using the minimal spanning tree method.

23

24

25

26

not-available-via-ai

Explanation

not-available-via-ai

44. By using the Cutting Algorithm, what would be the total distance?

20

21

22

23

The total distance would be 21. The Cutting Algorithm involves making a series of cuts to a given object, and the total distance is the sum of the lengths of all the cuts made. In this case, there are four options given, and the option with the total distance of 21 is the correct answer.

Explanation

The total distance would be 21. The Cutting Algorithm involves making a series of cuts to a given object, and the total distance is the sum of the lengths of all the cuts made. In this case, there are four options given, and the option with the total distance of 21 is the correct answer.

45. What type of problem is the Assignment Model?

The Assignment Model is a type of Allocation Problem. It involves allocating a set of resources to a set of tasks in the most efficient way possible. In this model, each task is assigned to exactly one resource, and each resource is assigned to exactly one task. The goal is to minimize the total cost or maximize the total benefit of the allocation. Therefore, the correct answer is Allocation Problem.

Explanation

The Assignment Model is a type of Allocation Problem. It involves allocating a set of resources to a set of tasks in the most efficient way possible. In this model, each task is assigned to exactly one resource, and each resource is assigned to exactly one task. The goal is to minimize the total cost or maximize the total benefit of the allocation. Therefore, the correct answer is Allocation Problem.

Submit

46. A special form of linear programming similar to transportation modelling.

The assignment model is a special form of linear programming that is similar to transportation modeling. It is used to determine the optimal assignment of tasks or resources to individuals or machines, taking into consideration various constraints and objectives. In this model, the goal is to minimize the total cost or maximize the total profit of the assignments. It is commonly used in operations research and management science to solve allocation problems efficiently.

Explanation

The assignment model is a special form of linear programming that is similar to transportation modeling. It is used to determine the optimal assignment of tasks or resources to individuals or machines, taking into consideration various constraints and objectives. In this model, the goal is to minimize the total cost or maximize the total profit of the assignments. It is commonly used in operations research and management science to solve allocation problems efficiently.

Submit

47. A construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below.

In which site should you moved bulldozer 3? State only the letter representing the garage.

Bulldozer 3 should be moved to garage B. This is because the question asks for the garage where bulldozer 3 should be moved, and the answer states "B".

Explanation

Bulldozer 3 should be moved to garage B. This is because the question asks for the garage where bulldozer 3 should be moved, and the answer states "B".

Submit

48. Meaning of "VAM" in VAM method of transportation modelling.

VAM stands for Vogel's Approximation Model, which is a method used in transportation modeling. This model is used to find an initial feasible solution for transportation problems by considering the costs and supplies/demands of different routes. Vogel's Approximation Model takes into account the penalties for unbalanced transportation, such as penalties for unused capacity or unmet demand. By using this model, transportation planners can optimize the allocation of resources and minimize costs in transportation systems.

Explanation

VAM stands for Vogel's Approximation Model, which is a method used in transportation modeling. This model is used to find an initial feasible solution for transportation problems by considering the costs and supplies/demands of different routes. Vogel's Approximation Model takes into account the penalties for unbalanced transportation, such as penalties for unused capacity or unmet demand. By using this model, transportation planners can optimize the allocation of resources and minimize costs in transportation systems.

Submit

49. Given the diagram below, find the total distance by using the Maximal Flow.

17

16

18

19

not-available-via-ai

Explanation

not-available-via-ai

Submit