Question: Homework #2 Question #1 The following Excel output is based on a linear programming problem of minimizing the cost of reating cars trucks SUVs and


Homework #2 Question #1 The following Excel output is based on a linear programming problem of minimizing the cost of reating cars trucks SUVs and sport cars to use in various trips and accommodating passengers. Answer the questions below and show your calculations Adjustable Cells Cell Name $B$2 Cars $C$2 Trucks $D$2 SUVS $E$2 Sport Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 18 0 29 17.5 21.5 6 0 39 6 17.2 6 0 45 172 6 0 17.5 42 1E30 17.5 Constraints Cell Name $F$4 Trips $F$S Rugged trips $F$6 Short trips $FS7 Passengers Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 30 0 30 0 1E430 12 34.5 12 8 0 0 18 21.5 18 4.8 0 150 1.5 150 24 24 1. What is the total cost? 2. How many cars should you rent? 3. You need to handle 20 short trip. What will be your cost? 4. The cost of a truck went up to 317. What will be your cust? 5. You have a budget of $1.050. How many passengers could you accommodate? 1 Question #2 Consider the following network. All distances are the same both ways. Question #3 Consider the following network of potential wires in a womputer integrated circuit. Electrical power is entering at component A and is to get to all other components. The mbers next to potential wires are the cost of constructing that wire which wires should be constructed so that every component will receive electricity at mim coat? 10 23 1 E H 15 9 21 7 3 7 10 23 B E H 21 12 16 A F - 1 9 K 17 15 21 7 7 7 10 27 22 21 5 8 3 12 21 21 16 - F 11 K 35 D HJ -C 6 22 27 21 5 8 8 31 35 8 1. Make a list of all the modes in alphabetical order and put the sbortest distance from mode A to each node next to them. D G 2. What is the shortest distance from A to K? 3. What is the shortest path from A to K? 1. Make a list of the selected wires as two letters each, for example AB is the wire connecting to B. Sort the list in alphabetical order 2. What is the total exist? 2 3 Homework #2 Question #1 The following Excel output is based on a linear programming problem of minimizing the cost of reating cars trucks SUVs and sport cars to use in various trips and accommodating passengers. Answer the questions below and show your calculations Adjustable Cells Cell Name $B$2 Cars $C$2 Trucks $D$2 SUVS $E$2 Sport Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 18 0 29 17.5 21.5 6 0 39 6 17.2 6 0 45 172 6 0 17.5 42 1E30 17.5 Constraints Cell Name $F$4 Trips $F$S Rugged trips $F$6 Short trips $FS7 Passengers Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 30 0 30 0 1E430 12 34.5 12 8 0 0 18 21.5 18 4.8 0 150 1.5 150 24 24 1. What is the total cost? 2. How many cars should you rent? 3. You need to handle 20 short trip. What will be your cost? 4. The cost of a truck went up to 317. What will be your cust? 5. You have a budget of $1.050. How many passengers could you accommodate? 1 Question #2 Consider the following network. All distances are the same both ways. Question #3 Consider the following network of potential wires in a womputer integrated circuit. Electrical power is entering at component A and is to get to all other components. The mbers next to potential wires are the cost of constructing that wire which wires should be constructed so that every component will receive electricity at mim coat? 10 23 1 E H 15 9 21 7 3 7 10 23 B E H 21 12 16 A F - 1 9 K 17 15 21 7 7 7 10 27 22 21 5 8 3 12 21 21 16 - F 11 K 35 D HJ -C 6 22 27 21 5 8 8 31 35 8 1. Make a list of all the modes in alphabetical order and put the sbortest distance from mode A to each node next to them. D G 2. What is the shortest distance from A to K? 3. What is the shortest path from A to K? 1. Make a list of the selected wires as two letters each, for example AB is the wire connecting to B. Sort the list in alphabetical order 2. What is the total exist? 2 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
