Multiple Choice
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below:
The firm needs to satisfy all demand each day, but would like to minimize the total costs.
Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j) ?
A) xA,1 + xA,2 + xA,3 ? 100
B) xB,1 + xB,2 + xB,3 ? 100
C) xC,1 + xxC,2 + xxC,3 ? 100
D) xA,1 + xB,1 + xxC,1 ? 75
E) xA,1, xA,2, xA,3, xB,1, xB,2, xB,3, xC,1, xC,2, xC,3 integer
Correct Answer:

Verified
Correct Answer:
Verified
Q47: When formulating a linear programming model on
Q48: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6598/.jpg" alt=" Where is the
Q49: Which of the following are categories of
Q50: When studying a resource-allocation problem, it is
Q51: It is usually quite simple to obtain
Q53: Transportation problems always involve shipping goods from
Q54: Resource-allocation problems have the following type of
Q55: Transportation problems are concerned with distributing commodities
Q56: The capacity row in a distribution-network formulation
Q57: Linear programming does not permit fractional solutions.