首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
data编程代写、代做Python,C++程序语言
项目预算:
开发周期:
发布时间:
要求地区:
Business Decision Analytics under Uncertainty
Assignment 1
Please show your entire work with brief, but sufficiently detailed explanation in a Word document. Start
your answer by typing your name, RUID and email address. You can refer to the course lectures to support
your answer. You can also use a graphing calculator or other computer software to visualize parts of the
questions when applicable. Please submit your work on Canvas as a Word document; handwritten answers
are not accepted. To help grading and adding comments, do not convert your work into a pdf file[s].
Question 1 (40 points)
You assist your client to select a location x = (x1 , x2) for a new service facility that will serve K = 50
customers by providing a single (identical type) service or commodity to each customer. As an example,
you can think of a centralized warehouse serving customers within a region.
The new facility can be located anywhere within the unit square : the square models a
100 km by 100 km rectangular region. The customers are modeled by points pk = (pk1 , pk2), k = 1, … , K
located within the unit square. Each customer’s yearly demand for the service is assumed to be a known
value: we also assume that all demands must be satisfied. Customers can have different relative weights,
proportionate to the size of their yearly demand. This aspect is expressed by assigning weights wk ≥ 0 to
each customer for k = 1, … , K. To illustrate the problem-type considered, please see the figure below that
shows the unit square (blue), a possible (but not optimized) location for the facility (black dot), and the
locations of the weighted customers (displayed by red dots of radius wk for k = 1, … , K).
Assume that the distance between the facility location x and customer k (point pk) is expressed by the socalled Manhattan (l1-norm) distance function defined by
d(x, pk) = |x1 - pk1| + |x2 - pk2|.
This definition corresponds to reaching the facility from a customer location pk by using a rectangular
network of streets or roads.
Formulate a decision model that optimizes the location of the facility. The quality of a location is expressed
by the weighted sum of all Manhattan distances between the facility and the customers k = 1, … , K.
You can find a lot of Internet and printed literature on this important type of problem. You can do this
research at your discretion, it is not required to answer the assignment questions.
Question 2 (20 points)
Determine the convexity properties of your facility location model. Based on the discussion in the course
lectures, state whether this facility location problem-type is expected to be “easy” or “hard” to solve.
Question 3 (20 points)
Assume now that the regions |x1 – x2| > 0.3, x1 + x2 > 1.5, x1
2 – x2 + 0.4 < 0, and x1
2 + 3 x2
2 < 0.5 within the
unit square must be excluded from consideration for the possible location of the facility. Compared to the
answer to Question 2, state whether this facility location problem is expected to be “easier” or “harder” to
solve.
Question 4 (20 points)
Propose an initial facility location that is likely to be a good “guess” of the solution to the problem. Briefly
explain your choice.
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
cis432代做、代写python/java程...
2024-05-04
eeen3007j代写、c++程序设计代...
2024-05-04
代写data程序、代做c/c++, jav...
2024-05-04
comp2006代做、代写c++程序语言
2024-05-04
comp26020代做、java/c++设计编...
2024-05-04
csci251 advanced programming...
2024-05-03
cs 6290: high-performance co...
2024-05-03
assignment 2: executing and ...
2024-05-03
ecse427/comp310 programmin...
2024-05-03
cs 452 (fall 22): operating...
2024-05-03
comp9414 23t2 assignment 2 ...
2024-05-03
dpst1091 23t1 assignment 2 ...
2024-05-03
program代做、代写python设计编...
2024-05-03
热点标签
finm8007
comp2006
comp26020
comp1721
eeen3007j
cis432
csci251
comp5125m
com398sust
32022
mth6158
comp328
finn41615
2024
mec302
mgmt3004
mgt7158
com160
as.640.440
econ3016
finm7405
econ7021
fin600
infs4205/7205
mktg2510-
f27sb
csse2310/csse7231
rv32i
eecs 113
comp1117b
cs 412
comp 315
econ7300
comp2017
ecs 116
fit5046
com6511
comp30024
acs341
econ1020
isys3014
acc408
comp1047
csc 256
cs 6347
finm7008
comp34212
csmde21
estr2520
comp285/comp220
mds5130/iba6205
finc6010
is3s665
busi2194
125.785
iom209
msin0041
econ339
cmt218
mast10007
comp5349
ecx2953/ecx5953
bios706
comp3310
mth6150
comp30027
comp20005
eec286
busi2211
bff2401
fnce90046
visu2001
mang6554
finc6001
125785
data423-24s1
engi 1331
fint2100
(520|600).666
can202
cs 61b
mast20029
info20003
stat512
econ3208
cmpsc311
engg1340
ecmt1010
fit5216
basc0003
ee3121
acct2002
comp5313
busi2131
ise529
elec372/472
csit940/csit440
cenv6141
comp3027/comp3927
ftec5580
comp1433
msci223
mark203
en3098
eden1000
ece6483
econ4410
mats16302
cs 6476
com6521
comp222
comp3211
comp10002
csc1002
chc6186
cs 161
comp27112
comp282
swen20003
comm1190
elec9764
acfi3308
acct7101
fin6035
comp2048
geog0163
comp2013
coen 146
dts101tc
sehh2042
comp30023
comp4880/8880
cs 455
07
stat0045.
fil-30023
celen085
psyc40005
math40082
are271
comp9311
ee5311
imse2113
comp 2322
acct2102
fnd109
int102
is3s664
is6153
data4000
accfin5034
fit5212
cs536-s24
fit5225
ecos3006
mes202tc
finc5001
stat3061
csc171
cs1b
7ssmm712
bu.450.760
cs170
comp3411
swen90004
cpt206
comp5313/comp4313—large
bl5611
kxo206
comp532
elec207
kxo151
cs 2820
cpt108
math2319
dts204tc
qm222
comp2511
ccs599
infs1001
mat2355
eeee4123
25721
ifn647
pols0010
hpm 573
qbus6860
comp9417
csci 1100
stat0023
cse340
comp2003j
cs 2550
cs360
fin 3080
ierg 4080
cs6238
cit 594
finm7406
hw6
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!