[Skip Breadcrumb Navigation]
| Home
|
| Chapter 5
|
| Self-Test Questions
|
| Multiple Choice
|
This activity contains 19 questions.
|
|
|
|
|
|
|
|
What type of model would be used to determine how a person can travel from one city to another while minimizing total distance traveled?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Which of the following statements is true?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
An assignment problem with five jobs to be performed and five employees to do these jobs will have how many constraints?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A transportation problem with three factories and three warehouses will have how many decision variables?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The shortest-path problem:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A transshipment model has two flow-out-of (source) nodes, four transshipment nodes, and three flow-into (destination) nodes. Each transshipment node is connected with both source nodes and with only one destination node. This network will have how many arcs?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Consider the following demand constraint in an unbalanced transportation problem: X11 + X12 + X13 ≤ 200. This would imply that:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Which of the following statements is true?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Which one of the following has one origin and one destination in the network?
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The flow balance constraint for each node in a transportation model network is:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The source node has a net flow that is
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The unbalance transportation problem where the total supply exceeds total demand is the case where:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
An alternate or multiple optimal solutions shows up in Solver when:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The assignment LP problems use the concept of zero and one where the zero and one indicate:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A shortest-path problem network has a total of 10 arcs in the network. To solve the problem one would use:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The shortest-path problem uses the concept of zero and one programming, where:
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The minimal-spanning tree model is the situation where
|
| |
|
|
|
|
|
|
|
|
Answer choices in this exercise appear in a different order each time the page is loaded.
Which method is used to solve assignment problem?
Although assignment problem can be solved either by using the techniques of Linear Programming or by the transportation method yet the assignment method developed by D. Konig, a Hungarian mathematician known as the Hungarian method of assignment problem is much faster and efficient.
What is optimal solution in assignment problem?
An assignment plan is optimal if optimizes the total cost or effectiveness of doing all the jobs. Hence we applied new method named improved zero suffix method, which is different from the preceding methods to apply in the assignment problems.
Which type of linear programming problem does assignment problems is classified?
Assignment problems can be classified as which type of linear programming problem? Fixed-requirement problems.
How the assignment problem is a special case of transportation problem?
The assignment problem is a special case of the transportation problem where the supply from every source and the demand at every sink are equal to 1. Such a situation arises naturally in the setting of assigning workers to jobs, or of assigning workers to a time schedule.