Scribd
Upload
32 views

MANSCIE

- The document discusses a self-test on linear programming models, including transportation, assignment, maximal flow, shortest route, and minimal spanning tree models. It includes 8 multiple choice questions to test the reader's understanding of different network models. - The discussion questions provide more details on how to determine the number of variables and constraints in transportation problems based on the number of sources and destinations, why assignment problem variables are binary, and examples of problems that can be solved using different network models. - The self-test is intended to help the reader assess their understanding of key concepts related to linear programming network models.

Uploaded by

Noel Famodulan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views

MANSCIE

- The document discusses a self-test on linear programming models, including transportation, assignment, maximal flow, shortest route, and minimal spanning tree models. It includes 8 multiple choice questions to test the reader's understanding of different network models. - The discussion questions provide more details on how to determine the number of variables and constraints in transportation problems based on the number of sources and destinations, why assignment problem variables are binary, and examples of problems that can be solved using different network models. - The self-test is intended to help the reader assess their understanding of key concepts related to linear programming network models.

Uploaded by

Noel Famodulan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Noel G.

Famodulan BSBA-MM 3rd Year 03-26-2023


Self-Test

 Before taking the self-test, refer to the learning objectives at the beginning of the chapter,
the notes in the margins, and the glossary at the end of the chapter.
 Use the key at the back of the book to correct your answers.
 Restudy pages that correspond to any questions that you answered incorrectly or
material you feel uncertain about.
C 1. In a transportation problem with an equal number of 4 sources and destinations, the resulting
LP will have
a. 4 variables/4 constraints.
b. 8 variables/8 constraints.
c. 16 variables/8 constraints.
d. 8 variables/16 constraints.
A 2. In which way can an assignment problem be defined?
a. a special case of a transportation problem
b. a problem where all variables are either 0 or 1
c. a problem where all RHS values are equal to 1
d. all of the above
C 3. A company is considering opening one new production facility, and three locations are being
considered. For this facility location problem, how many transportation models must be
developed and solved?
a. 1
b. 2
c. 3
d. 4
C 4. Four cranes are being assigned to five construction jobs. One of the jobs will be delayed until
one of the cranes becomes available after finishing the first job. An assignment model will be
used. To allow specialized software to find a solution to this problem,
a. Nothing special must be done to this problem.
b. One dummy crane must be used in the model.
c. One dummy job must be used in the model.
d. Both a dummy job and a dummy crane must be used in the model.
B 5. Which type of network model finds the maximum flow of any quantity or substance passing
through at a given moment?
a. the shortest-route model
b. the maximal-flow model
c. the transhipment model
d. the minimal-spanning tree model
B 6. Assigning staff to a fast-food restaurant is an example of
a. The shortest-route model.
b. The assignment model.
c. The maximal-flow model.
d. The transportation model.
B 7. A large city is planning for the Olympic Games which will be coming in a few years. The
transportation system is being evaluated to determine what expansion is needed to handle the
large number of visitors to the games. Which of the following models would most likely help the
city planners determine the capacity of the current system?
a. The transportation model.
b. The maximal-flow model.
c. The shortest-route model.
d. The minimal-spanning tree model.
D 8. Which type of network model determines the path connecting all the points while minimizing
total distance? This model is often used for finding the best way to connect nodes in order to
optimize their resource allocation.
a. the maximal-flow model
b. the transportation model
c. the shortest-route model
d. the minimal-spanning tree model

Discussion Questions:
9-1 In facility location problems, how many transportation models need to be developed to
determine the best location of a new production facility?
- In facility location problems, one transportation model needs to be developed in each
location being considered.
9-2 explain how to determine the number of variables and constraints that would be in a
transportation problem simply by knowing the number of sources and the number of
destinations.
- To find the number of variables in a transportation problem, just multiply the number of
sources by the number of destinations. Simultaneously, add the number of sources to the
number of destinations to obtain the constraints.
9-3 In assignment problems, why are variables always 0 or 1?
- The assignment problem entails determining the most efficient (and typically least
expensive) method of assigning personnel or pieces of equipment to certain projects or
occupations on a one - to - one basis. In other words, each worker is allocated to a single
job, and each job requires just one person.
9-4 If a transportation problem has nine variables, how many sources are being considered?
- The number of sources examined cannot be determined without knowing the number of
destinations.
9-5 What kind of problems can be solved with the minimal-spanning tree model?
- Minimum spanning trees have direct applications in the design of networks, including
computer networks, telecommunications networks, transportation networks, water supply
networks, and electrical grids.
9-6 describe a business operation problem that can be modelled as a transhipment problem.
- Transhipment is a subset of the transportation problem in which shipping routes may
have intermediate stations. Shipping from Quezon City to Tacloban through Sorsogon,
for example, may be less expensive than shipping directly to Tacloban (non - stop).
Intermediate stations are also necessary when different modes of transportation have
varying prices (for example, shipping via truck versus rail) or when products must be
temporarily kept at intermediate locations for processing or packing.

You might also like