| Course | BUS 660 Quantitative Methods |
|---|---|
| Topic | Topic 6 |
| Paper type | Transportation problem |
| Length | About 990 words, 2 pages |
| Format | APA 7 student paper |
| School | Grand Canyon University (GCU) |
| Program | MBA |
| Updated | October 2026 |
Free sample paper for BUS 660 Topic 6
Two Bakeries, Four Destinations and 200 Trays of Spare Capacity: Recognizing a Transportation Problem and Reading Its Plan
[Author Name]
Colangelo College of Business, Grand Canyon University
BUS-660: Quantitative Methods
Topic 6 Transportation Problem
[Instructor Name]
[Date]
The organization, setting and figures below are a composite written as a model document. No real employer, client, colleague or patient is described.
Two Bakeries, Four Destinations and 200 Trays of Spare Capacity: Recognizing a Transportation Problem and Reading Its Plan
Recognizing the Shape
A composite regional bakery company runs two plants, North and South, and ships trays of bread each week to three grocery distribution centers and a restaurant supply hub. It wants the shipping plan that meets every destination's order at the lowest delivery cost. Before modeling, the problem's type should be recognized, because the formulation follows from it (Anderson et al., 2019). This is a transportation problem: sources with supply, destinations with demand and a cost per unit on each route. It is not an assignment problem, the special case in which each source serves exactly one destination, such as assigning one driver to one route, nor a blending problem, which mixes inputs, such as flours, to meet specifications at least cost. Figures are illustrative.
The Data
North can bake 1,300 trays a week and South 1,000, a total supply of 2,300. The destinations need 700 trays at distribution center 1, 500 at center 2, 600 at center 3 and 300 at the restaurant hub, a total demand of 2,100. Delivery costs per tray reflect distance and road conditions.
Table 1
Delivery Cost per Tray and Weekly Supply and Demand, Dollars
| From / to | Center 1 | Center 2 | Center 3 | Restaurant hub | Supply |
|---|---|---|---|---|---|
| North plant | 1.20 | 1.60 | 2.10 | 1.40 | 1,300 |
| South plant | 1.90 | 1.30 | 1.10 | 1.50 | 1,000 |
| Demand | 700 | 500 | 600 | 300 | 2,100 |
Balancing Supply and Demand
Supply exceeds demand by 200 trays. The transportation model requires them to balance, so the analysis adds a dummy destination with demand of 200 and zero shipping cost (Render et al., 2018). Trays assigned to the dummy are capacity left unused, not real shipments. Adding the dummy explicitly, rather than quietly lowering a plant's supply, keeps the model honest about where the spare capacity sits; the solution then shows which plant should carry it.
The Formulation
Let x be the number of trays shipped on each of the eight real routes and the two dummy routes. The objective is to minimize the sum of each route's cost times its trays. The supply constraints require each plant's shipments, including to the dummy, to equal its capacity. The demand constraints require each destination to receive exactly its order. All shipments are non-negative.
The Solution
The lowest-cost plan has North ship 700 trays to center 1, 300 to the restaurant hub and 100 to center 2, with its remaining 200 trays of capacity assigned to the dummy. South ships 400 trays to center 2 and 600 to center 3, using its full 1,000. Weekly delivery cost is 2,600 dollars.
Table 2
Optimal Weekly Shipping Plan, Dollars
| Route | Trays | Cost per tray | Cost |
|---|---|---|---|
| North to center 1 | 700 | 1.20 | 840 |
| North to center 2 | 100 | 1.60 | 160 |
| North to restaurant hub | 300 | 1.40 | 420 |
| South to center 2 | 400 | 1.30 | 520 |
| South to center 3 | 600 | 1.10 | 660 |
| North unused capacity (dummy) | 200 | 0 | 0 |
| Total | 2,100 shipped | | 2,600 |
Reading the Plan
The plan is a schedule somebody could execute, and its logic is visible. Each destination goes mainly to the plant with the cheaper route: center 1 and the hub to North, center 3 to South. Center 2 is split because South, its cheaper source, runs out of capacity after serving center 3, where its cost advantage is largest, at 1.00 dollar a tray. The 100 trays North sends to center 2 cost 30 cents more each than South would charge, the smallest penalty available.
The unused routes are findings, not blanks. No trays go from North to center 3 or from South to center 1, because those routes cost 1.00 and 0.70 dollars more per tray than the alternatives. And the 200 trays of spare capacity sit at North, not South, which tells the company where it could take on new business cheaply.
Checking That the Plan Is Optimal
Optimality can be checked by asking whether any reallocation would lower cost. Moving a tray of center 3's supply from South to North would cost 1.00 dollar more and free a South tray for center 2, saving 0.30, a net increase of 0.70. Moving a tray of center 1's supply to South would cost 0.70 more, and South has no spare capacity anyway. Moving hub trays to South would cost 0.10 more per tray and would also require displacing South's shipments to center 2, adding 0.30 more. Every possible exchange raises cost, so no cheaper plan exists. A full enumeration of plans in steps of 50 trays confirms 2,600 dollars as the minimum. In larger networks, the same check is done systematically by computing the cost change of every unused route, which is what transportation software reports.
What the Plan Suggests
Two decisions follow. South is the binding plant: one more tray of South capacity would save 30 cents, by replacing a North tray to center 2. If South could add capacity for less than that per tray, it would pay. And a new customer near North could be served from North's 200 spare trays at no cost in capacity, so the sales team should look for customers in North's region first.
An Old Problem With a Standard Form
The transportation problem was first stated in this form by Hitchcock (1941), who described shipping a product from several sources to many destinations at least cost. Its structure, supplies, demands and a cost per unit on each route, is what lets it be solved quickly and lets the bakery read the solution's spare capacity directly. Recognizing the shape is most of the work; once recognized, the solution method is routine.
Conclusion
Recognizing a transportation problem made the formulation immediate. With a dummy destination absorbing 200 trays of excess supply, the plan ships 2,100 trays at 2,600 dollars a week, splits only center 2 between plants, leaves the spare capacity at North and shows South as the constraint. The unused routes and the location of the spare capacity are as informative as the shipments themselves.
References
Anderson, D. R., Sweeney, D. J., Williams, T. A., Camm, J. D., Cochran, J. J., Fry, M. J., & Ohlmann, J. W. (2019). An introduction to management science: Quantitative approaches to decision making (15th ed.). Cengage.
Hitchcock, F. L. (1941). The distribution of a product from several sources to numerous localities. Journal of Mathematics and Physics, 20(1-4), 224-230. https://doi.org/10.1002/sapm1941201224
Render, B., Stair, R. M., Hanna, M. E., & Hale, T. S. (2018). Quantitative analysis for management (13th ed.). Pearson.
What the BUS 660 Topic 6 instructions ask for
Topic 6 in BUS-660 asks MBA students to model and solve a network optimization problem. Strong submissions name the problem type, transportation, assignment or blending, before modeling, balance supply and demand explicitly with a dummy row or column, and write the formulation from the type. Students should present the solution as a plan someone could execute, check its optimality, read unused routes and the location of spare capacity as findings, and draw business decisions from which source is binding. Optimality should be checked by testing exchanges between routes. Students should also handle the imbalance between supply and demand explicitly and interpret the spare capacity the solution leaves.
How this BUS 660 Topic 6 example is built
The finished example recognizes the shape before it models. A transportation problem has sources with supply, destinations with demand and a cost on each route; an assignment problem is the special case where each source serves exactly one destination; a blending problem mixes inputs to meet specifications at least cost. Once the type is named, the formulation follows immediately from it. Supply and demand are checked for balance, and where they do not match the example adds the dummy row or column explicitly rather than adjusting quietly. The solution is then read as a shipping plan somebody could execute, with the routes that go unused noted as a finding rather than as blanks.
BUS 660 Topic 6 rubric: what Excellent looks like
Faculty reward a model that starts by recognizing its shape. An Excellent paper distinguishes transportation from assignment and blending problems before formulating. Credit goes to a dummy destination of 200 trays added explicitly and a cost table by route. The rubric values a shipping plan totaling 2,600 dollars, following Render and colleagues, with optimality checked by testing exchanges. Strong papers read unused routes and North's spare capacity as findings. Top marks go to identifying South as binding and valuing its capacity at 30 cents a tray. Papers that recognize the problem's standard form, as Hitchcock first stated it, and then read the shipping plan for what it implies about each plant's future, show more than a solved table.
BUS 660 Topic 6 help before you submit
Building a general model where a recognized structure exists is the inefficiency this topic is written to remove, since naming the type supplies the standard formulation immediately. A second failure is unbalanced supply and demand handled silently, which produces an infeasible model or a wrong answer depending on how the software copes. Papers lose marks for flow variables that do not identify their route, because the solution then cannot be read as a plan. Reporting the minimum cost without stating the shipping pattern gives a manager a number and no instructions. Ignoring the unused routes discards a finding about the network that is often more valuable than the cost saving itself.
Get a BUS-660 Topic 6 example written to your instructions
Send the BUS-660 Topic 6 problems and the rubric from your classroom, with the network data your section supplied. We write a custom example to those criteria, with the structure identified, supply and demand balanced explicitly, variables defined by route and the solution written as an executable plan, in 24 to 48 hours. The first is free.
More BUS 660 papers and MBA samples
- BUS 660 Topic 1: Payoff Table Analysis
- BUS 660 Topic 2: Decision Tree Analysis
- BUS 660 Topic 3: Forecasting Method Comparison
- BUS 660 Topic 4: Predictive Regression Model
- BUS 660 Topic 5: Linear Programming Formulation
- BUS 660 Topic 7: Simulation and Inventory Analysis
- BUS 660 Topic 8: Project Scheduling Recommendation
- BUS 655 Topic 6: Renewal Risk Model
- BUS 635 Topic 6: Merchandise Margin Analysis
- ACC 650 Topic 6: Master Budget Build
- HRM 635 Topic 6: Training Return Evaluation Plan
BUS 660 Topic 6 questions, answered
How do I recognize which network problem I have?
Look at what is being moved and how it is constrained. Sources with capacity, destinations with requirements and a cost per route is a transportation problem. If each source serves exactly one destination and the numbers match, it is an assignment problem. If you are combining inputs to hit a specification at minimum cost, it is blending. The features identify the type in about a minute.
What if supply does not equal demand?
Add a dummy source or destination to absorb the difference, with zero cost on its routes, and say in the paper that you did. Excess supply gets a dummy destination representing unshipped goods; excess demand gets a dummy source representing unmet orders. Handling it explicitly also lets you report which demand went unmet, which is usually worth knowing.
Why do unused routes matter?
Because they tell you which parts of your network the optimum does not need. A route that never carries anything under any reasonable scenario is a candidate for closure or renegotiation, and a source that ships nothing may be misplaced. That kind of structural finding often outweighs the cost saving from optimizing the current network, and it costs one paragraph to report.
Where can I find a free BUS 660 Topic 6 sample paper?
The transportation problem is shown here complete: recognizing the shape, the data, balancing with a dummy, the formulation, the solution, reading the plan, checking optimality, what it suggests and the conclusion. Share your network data and we will solve it at no cost.
Why add a dummy destination in BUS 660 Topic 6?
Supply of 2,300 trays exceeds demand of 2,100, and the model needs them balanced. The dummy's 200 trays show where unused capacity sits rather than hiding it.