Consider the network shown in the following figure. Number in the box next to a
ID: 3804308 • Letter: C
Question
Consider the network shown in the following figure. Number in the box next to a node represents demand; the number on the arc represents the distance between the nodes. Note the graph is not drawn to scale.
1) For the above network, find the maximum number of nodes that could be covered with 2 facilities, each placed at one of the A-I nodes.
2) For the above network, solve a p-center problem with p = 3.
3) For the above network, solve a p-median problem with p = 3.
4) What can you comment about the solution in b and c? Justify.
5) Now suppose that the construction costs are as follows: A ($100), B ($200), C($130), D($150), E($225), F ($175), G($190), H($210), and I($165). Suppose the cost of shipping one unit of material per mile is $0.35. Solve the corresponding Uncapacitated Facility Location Problem.
For the above problems, please provide the mathematical model and solve it using Excel (with formulae displaying is appreciated). SOLVE AS MANY AS YOU CAN
15 10 18 18 15 22 CA B) C) D) 16 24 12 20 18 F) 24 25 24 12 12 30 GY 11 13 16Explanation / Answer
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"Contacts.h"
struct ContactNode* CreateContactNode(struct ContactNode* p, char name[], char phone[])nextNodePtr=temp;
" id="tip_4">
return(temp);
}
struct ContactNode* GetNextContact(struct ContactNode* p) come p->nextNodePtr;
}
void PrintContactNode(struct ContactNode* p) ;
struct ContactNode* CreateContactNode(struct ContactNode* p, char name[], char phone[]);
struct ContactNode* InsertContactAfter(struct ContactNode* p,char name[], char phone[]);
struct ContactNode* GetNextContact(struct ContactNode* p);
void PrintContactNode(struct ContactNode* p);
#endif
Main.c
#include <stdio.h>
#include <stdlib.h>
#include"Contacts.h"
int main()
}
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"Contacts.h"
struct ContactNode* CreateContactNode(struct ContactNode* p, char name[], char phone[])nextNodePtr=temp;
" id="tip_4">
return(temp);
}
struct ContactNode* GetNextContact(struct ContactNode* p) come p->nextNodePtr;
}
void PrintContactNode(struct ContactNode* p) ;
struct ContactNode* CreateContactNode(struct ContactNode* p, char name[], char phone[]);
struct ContactNode* InsertContactAfter(struct ContactNode* p,char name[], char phone[]);
struct ContactNode* GetNextContact(struct ContactNode* p);
void PrintContactNode(struct ContactNode* p);
#endif
Main.c
#include <stdio.h>
#include <stdlib.h>
#include"Contacts.h"
int main()
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.