MCQ(s) On Optimization Research Unit 1: Applications of LP
Question: 1
What is the main objective of the transportation problem in linear programming?
- To minimize the transportation time
- To minimize the transportation cost
- To maximize the number of routes
- To maximize the transportation distance
Click to see the answer
Correct Answer: B. To minimize the transportation cost
Explanation: The transportation problem aims to determine the most cost-effective way to distribute products from several suppliers to several consumers while minimizing the total transportation cost.
Question: 2
In the transportation problem, what do the supply constraints represent?
- The maximum demand at each destination
- The minimum transportation cost
- The availability of goods at each source
- The capacity of each transportation route
Click to see the answer
Correct Answer: C. The availability of goods at each source
Explanation: Supply constraints represent the amount of goods available at each source, ensuring that the shipments from each source do not exceed its supply.
Question: 3
Which method is commonly used to find the initial feasible solution of a transportation problem?
- Hungarian method
- Simplex method
- Northwest corner method
- Dijkstra's algorithm
Click to see the answer
Correct Answer: C. Northwest corner method
Explanation: The Northwest corner method is a technique used to find an initial feasible solution for the transportation problem by starting at the top-left (northwest) corner of the cost matrix.
Question: 4
In the context of the assignment problem, what does the objective function typically seek to optimize?
- The total time
- The total cost
- The total distance
- The total resources
Click to see the answer
Correct Answer: B. The total cost
Explanation: The objective of the assignment problem is to assign tasks to agents in such a way that the total assignment cost is minimized.
Question: 5
What is the key difference between the transportation problem and the assignment problem?
- The transportation problem deals with minimizing costs, while the assignment problem deals with maximizing profits
- The transportation problem involves sources and destinations, while the assignment problem involves agents and tasks
- The transportation problem is solved using the Hungarian method, while the assignment problem is solved using the Simplex method
- The transportation problem is linear, while the assignment problem is nonlinear
Click to see the answer
Correct Answer: B. The transportation problem involves sources and destinations, while the assignment problem involves agents and tasks
Explanation: The transportation problem involves distributing goods from multiple sources to multiple destinations, whereas the assignment problem involves assigning tasks to agents such that the total cost is minimized.
Question: 6
Which of the following algorithms is commonly used to solve the assignment problem?
- Prim's algorithm
- Kruskal's algorithm
- Hungarian algorithm
- Floyd-Warshall algorithm
Click to see the answer
Correct Answer: C. Hungarian algorithm
Explanation: The Hungarian algorithm is an efficient method used to solve the assignment problem by finding the optimal assignment that minimizes the total cost.
Question: 7
What is the term used for a solution in the transportation problem where all supply and demand constraints are satisfied?
- Feasible solution
- Optimal solution
- Degenerate solution
- Unbounded solution
Click to see the answer
Correct Answer: A. Feasible solution
Explanation: A feasible solution in the transportation problem is one where all supply and demand constraints are satisfied, meaning all the goods are distributed without violating any constraints.
Question: 8
In a balanced transportation problem, what is true about the total supply and total demand?
- Total supply is less than total demand
- Total supply is greater than total demand
- Total supply equals total demand
- Total supply and demand are unrelated
Click to see the answer
Correct Answer: C. Total supply equals total demand
Explanation: In a balanced transportation problem, the total supply exactly matches the total demand, ensuring that all goods can be distributed without surplus or shortage.
Question: 9
Which of the following represents an assignment problem scenario?
- Distributing goods from warehouses to stores
- Assigning workers to specific jobs
- Allocating resources to multiple projects
- Scheduling flights between cities
Click to see the answer
Correct Answer: B. Assigning workers to specific jobs
Explanation: The assignment problem involves allocating resources (such as workers) to specific tasks or jobs in a way that optimizes the overall cost or efficiency.
Question: 10
In the transportation problem, what does the term 'degeneracy' refer to?
- A situation where the supply exceeds the demand
- A situation where multiple optimal solutions exist
- A situation where the number of allocations is less than \( m + n - 1 \)
- A situation where there are infeasible solutions
Click to see the answer
Correct Answer: C. A situation where the number of allocations is less than \( m + n - 1 \)
Explanation: Degeneracy in the transportation problem occurs when the number of basic variables (allocations) is less than \( m + n - 1 \), where \( m \) is the number of rows and \( n \) is the number of columns in the cost matrix.
Previous: The Simplex MethodNext: Unit II