logo Hurry, Grab up to 30% discount on the entire course
Order Now logo

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Allen CrumppTechnical writing
(5/5)

899 Answers

Hire Me
expert
Bhupesh SinglaComputer science
(5/5)

846 Answers

Hire Me
expert
Farukh AbdullaEconomics
(5/5)

993 Answers

Hire Me
expert
Dushyant ChertriLaw
(5/5)

810 Answers

Hire Me
Linear Programming
(5/5)

Develop the algebraic model. Define the decision variables, identify the objective function, and identify all of the constraints.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Problem Scenario:

The following is a diagram of a local road network, where the Values in the circles are labels for locations and the values on the arcs represent the distances between locations.

 

Due to current conditions, the roads have limited capacities. Each road can only handle a limited amount of traffic. With the exception of the road between 4 and 5 each road can handle 300 tons of traffic, the road between 4 and 5 can only handle 150 tons.

The territory being supplied is dangerous, and ambushes are frequent. It is safe between nodes 1, 2, and 3. But East of 2/3 ambushes result in 5% lose per transition.

Node 8 requires 400Tons of supplies. It costs $5/mile/ton to deliver the supplies.

Build a model that will minimize the shipping costs.

Requirements:

1. [5 Points] Develop the algebraic model. Define the decision variables, identify the objective function, and identify all of the constraints.

2. [10 Points] Develop the Excel model. Color code the model to clearly identify the inputs, outputs, and decision variables. Email me a copy of the Excel file as directed in the administrative instructions.

3. 15 Points] What is your recommended shipping solution? How many tons need to be available at depot 1?

4. 15 Points] How dependent is your answer on the ambush rate?

(5/5)
Attachments:

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme

March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30