Question: Lingo Problem Question 1 (1 mark): Consider the following graph: n2 n3 3 n4 8 ns Given a covering distance D=10, formulate the location set

Lingo Problem Question 1 (1 mark): Consider the following graph: n2 n33 n4 8 ns Given a covering distance D=10, formulate the locationLingo Problem

Question 1 (1 mark): Consider the following graph: n2 n3 3 n4 8 ns Given a covering distance D=10, formulate the location set covering problem & solve it with LINGO. Note: It is not necessary to determine the shortest path matrix with an algorithm. What happens if D = 4? Formulate & solve. Question 2 (1 mark): Consider again the graph in Question 1. Given that the number of customers at the nodes ni, ..., ns are 30, 50, 40, 60, & 50, respectively, maximize the number of customers covered for D= 2 & p=3 facilities. Formulate the problem in LINGO style & solve. Question 1 (1 mark): Consider the following graph: n2 n3 3 n4 8 ns Given a covering distance D=10, formulate the location set covering problem & solve it with LINGO. Note: It is not necessary to determine the shortest path matrix with an algorithm. What happens if D = 4? Formulate & solve. Question 2 (1 mark): Consider again the graph in Question 1. Given that the number of customers at the nodes ni, ..., ns are 30, 50, 40, 60, & 50, respectively, maximize the number of customers covered for D= 2 & p=3 facilities. Formulate the problem in LINGO style & solve

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!