Linear programming with excel and math skills Number 2
Use Solver to set up and solve problem No. 32, page 125 of your textbook. Make sure to embed your formulation to the Linear Programming problem within your Excel solution. This problem is a classic transportation problem application where locations 1 and 2 serve as the “supply nodes”, and locations 3, 4, 5 and 6 serve as the “demand nodes”. In addition to the typical supply and demand constraints that you need to include, make sure to also account for the constraints which will ensure that locations 3, 4, 5, and 6 each receive at least 5 cars.
on Sat, 2012-04-14 02:21
Answer rating (rated one time)
check attached file.
body preview (1 words)
xxxxxxxx
file1.docx preview (268 words)
xxx xxxxxx to xxx up and xxxxx the problem xxxxxx Make sure to embed your xxxxxxxxxxx xx the xxxxxx xxxxxxxxxxx xxxxxxx within your Excel solution. xxxx xxxxxxx xx x xxxxxxx xxxxxxxxxxxxxx xxxxxxx xxxxxxxxxxx where xxxxxxxxx x xxx 2 xxxxx xx xxx “supply nodes”, and locations xx xx 5 xxx x xxxxx xx the “demand nodes”x In addition xx the typical supply and demand xxxxxxxxxxx xxxx you xxxx xx xxxxxxxx xxxx sure xx xxxx xxxxxxx for xxx xxxxxxxxxxx xxxxx xxxx ensure xxxx locations xx xx 5, xxx 6 each receive at xxxxx 5 xxxxx
Problem:
The xxxxxxxxxxx car rental xxxxxxx xxxxxx its xxxxxxxxx xx pick up a xxxxxx xxx xx xxx location and xxxxxx it to any xx its xxxxxxxxxx xxxxxxxxxx xxx locations (1 and 2) have xx and xx surplus cars, xxxxxxxxxxxxx and four xxxxxxxxx ( 3,4,5, xxx 6) xxxx
- - - more text follows - - -
file2.xls preview (116 words)
data
| xxxxxxxxxxx | |||||
| Transportation Costs ($ per car) | Cars | ||||
| 3 | x | xx | x6 | xxxxxxxxxx | |
| x | * 54.00 | x xxxxx | * xxxxx | x 30.00 | 16 |
| x | x xxxxx | xx xxxxx | x xxxxx | x* xxxxx | xx |
| xxxx Needed | xxx | xx | 10 | 1 |
xxxxxxxxx
| Rent-A-Dent | ||||||
| Transportation xxxxx ($ per xxxx | ||||||
| x | x4 | x | x6 | |||
| 1 | * xxxxx | * xxxxx | x* 23.00 | xx 30.00 | ||
| x | xx 24.00 | x xxxxx | * xxxxx | xx 31.00 | ||
| xxxx Transported to Location: | xxxx | xxxx | ||||
| x | xx | xx | x | xxxxx | xAvailable | |
| x | xx | xx | xx | 5 | x16 | 16 |
| 2 | x | x | 9 | x0 | xx | x18 |
| Actual | x | 10 | xxx | x5 | ||
| Min. | x5 | 5 | xx | x | ||
| xxxx | xxx | x10 | xxx | xxx | ||
| Total Transportation Cost: | * 730.00 |
xxxxxxx
| Problem xxxx | Optimal xxxxxxxx | ||
| 10 | xxxxxx10 | ||
| 16 | 15 | ||
| xx | xxxxxx10 | ||
| 18 | xxxx10 | xx | xxxxxx |
| xx | x |
Buy this answer  | Try it before you buy it |