BIT 3434 Exam 2 Study Guide Questions With
100% Accurate Answers
the transshipment problem - Answer is the most general type of network flow problem
the arcs in a network indicate - Answer the valid paths, routes, or connections between
the nodes in a network flow problem
the net supply for each node in the network is indicated by - Answer a negative number
next to each node
A transshipment node can have - Answer either a net supply or demand, but not both
In a transshipment problem formulation, the decision variables are of the form - Answer
Xij, which is the number of items shipped (or flowing) from node i to node j
The objective in most network flow problems is to - Answer minimize total cost, distance
or penalty that must be incurred to solve the problem
balance of flow constraints - Answer define a relationship between inflow and outflow
for every node in a network
a problem in which we want to find the shortest (or least costly) route or path through a
network from a starting node to an ending node is called - Answer the path problem
in a typical path problem, the supply node flor constraint RHS is equal to - Answer -1
If you use the simplex method to solve any minimum cost network flow model having
, integer constraint RHS values, then - Answer the optimal solution automatically
assumes integer values
The equipment replacement problem is a type of problem that can be modeled as a -
Answer shortest path problem
Any shortest path problem can be modelled as a transshipment problem bby - Answer
assigning a supply of 1 to the starting node, a demand of 1 to the ending node and a
demand of zero to all other nodes in the network
a transportation problem - Answer is a special case of transshipment problem
Suppose you want to determine the minimum cost of shipment using a transportation
problem formulation. Further, you do not want to send any shipment from source i to
destination j. When modeling this situation you should - Answer assign a large cost, cij=
M, to the shipment quantity, Xij between source i and destination j
Consider a transportation problem in which total demand exceeds total supply. In order
for such a problem to be in standard form, you would add a dummy supply whose
capacity equals the difference between total demand and total supply. See "dummy
nodes and arcs" in chapter 5 for more information.
you want to assign m jobs to n machines to minimize the assignment total cost. you
model this problem as an assignment problem in a standard form. In your formulation: -
Answer all constraints RHS are strictly equal to 1
the objective function in a minimal spanning tree problem is to - Answer determine the
set of arcs that connect all the nodes in the network
what is the correct constraint for the following diagram - Answer x12 +x13 >= 50
what is the constraint for node 3 in the following shortest path problem - Answer
-x13+x34=0
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Easton. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.99. You're not tied to anything after your purchase.