The Linear Programming questions.

Question #1

Cell Name Value

$B$2 Cars 18 $C$2 Trucks 6 $D$2 SUVs 6 $E$2 Sport 0

Cost Coefficient

0 29 0 39 0 45

17.5 42

Increase Decrease

17.5 21.5 6 17.2 17.2 6 1E+30 17.5

Homework #2

The following Excel output is based on a linear programming problem of minimizing the cost of renting cars trucks SUVs and sport cars to use in various trips and accommodating passengers. Answer the questions below and show your calculations.

Constraints

Final Shadow Constraint Allowable Allowable

Cell Name Value Price R.H. Side

1. $F$4Trips 30 0 30
2. $F$5Rugged trips 12 34.5 12
3. $F$6Short trips 18 21.5 18
4. $F$7Passengers 150 1.5 150

Increase

0

8 4.8 24

Decrease

1E+30 0 0 24

1. What is the total cost?

2. How many cars should you rent?

3. You need to handle 20 short trips. What will be your cost?

4. The cost of a truck went up to $47. What will be your cost?

5. You have a budget of $1,050. How many passengers could you accommodate?

Homework #2 Question #1 The following Excel output is based on a linear progi'almiliilg problem oi minimizing the cost or renting cars trucks 3qu and sport can to use in various mos and anceimuodming passengers. Answer the qumtious below and show your calculations. Mustable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefcient Increase Decrease $552,913 1,8: 29, 17.5 215, $C$2 Trucks 6 39 6 17,2 $D$2 SUVs 6 45 17,2 6 $E$2 Sport o 17' 1E+30 17.5 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Slde Increase Decrease $F$4 Trips 30 0 30 0 1E+30 $F$5 Rugged trips 12 34.5 12 8 0 $F$6 Short trips 18 21.5 18 4.8 0 $F$7 Passengers 150 1.5 150 24 24 l. \\Vllat is the total east? 2. How many cars should you rent? 3. You need to handle 20 short trips. \\Vllal. will be your cost? 4. The cost ofa truck went up to $47. What will be your cost? 5' You have a budget of $1.0504 How many passengers could you accommodate? Question #2 Question #3 Consider the following nelwork, All distances are lhesanre lroilr ways. Coinirler the following network or pmmtial wire. in n (:olllputer inmgmlwl (:i . n. Eltxttrkal [lower i..- onuring at. component A and noorh to gm. tn nil other conipnnon... Tho nnrnhrno rim to polonliol wires are lho cost oi can rusting uni: wire. Which wires should be conslrnolod so that every ronrnonmi will waive electricity at a rnininnnn (,ost'l D 1. Make a list of all the nodes in alplmlmtical order and put the shortest distance from nude A Lo oach node next to Lhein. 2. \"'11le is the sliurtvst distaure from A tu K7 1. Make n list of the selcoml wires th' Lwa lollors enoh. for oxnnrplo AB is the wire connecting 3- Wlmt is the shortest path from A to K! A to B, Sort the list in alplldlmtim] order. 2. Wlmt la the total mst']