Consider a scenario where C is the set of clients and S is the set of servers. Each client i in set Ccan be served by server j in set S with a service cost Cij. Because of the emerging issue of carbonemission and global warming at most k servers can stay functional at a time. Our objective is tofind the optimal set of k servers so that each client can be served while minimizing the total servicecost. Let OPT be the sum of the service costs over all clients for the optimal solution.1. Design an LP representing the problem. [clearly describe in language the variables, describethe constraints and objective function]2. Write the dual LP.

Detailed explanation: 1. Design the Linear Programming (LP) FormulationVariables:Decision…

Answered: Consider a scenario where C is the set…

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.8: The M/g/1/gd/∞/∞ Queuing System

Problem 4P

See similar textbooks

Similar questions

Let a network be given by nodes V = {S, A, B,C, D,T} and arcs, capacities e and a flow f according to the table: SA SC AB Bт АC DC BD DT AT CT 3 ? 4 1 1 ? 3 4 3 5 ? 3 9. 3 5 1 1 (a) Complete f and e such that f is an admissible flow from S to T. Justify your answer. What is the value of the flow?
Consider the following scenario and answer the following questions. Consider an online reservation system for a bus company. The bus company includes several buses and realizes trips to different cities. Each bus is identified by its plate number and a separately assigned bus number. The trips are based on a predefined schedule and stop at predefined bus stations. Each bus can have only one trip per day. Each bus includes a driver and one hostess. For long trips, the bus will have breaks at service and rest areas. There are two types of trips, normal trips and express trips. Express trips do not stop at intermediate stations and get faster at the destination. Seats can be reserved by customers on the web site of the bus company. The customer has the option to directly pay for the seat through the website. In that case, the seat cannot be cancelled (neither by the customer nor by the bus company). If the customer has not paid for the seat, the bus company can cancel the seat if the…
= In this exercise we will use a simplified mathematical model to analyze failures in a distributed system. Explain your answers. Suppose each computer in has a probability of p of failing at any time. a) If n computers are interconnected and the availability of each computer is needed to maintain a service provided using distributed computing involving these computers, what is the probability that the service will not be available at any time, assuming that no other components in the distributed system will fail? b) Use p = 0.2 and n = 3 to compute the probability. How does it compare with the failure probability if the same computing is performed using monolithic computing, that is, on one computer only? = t6
I want a solution from a professor in software engineering
The state of resource A,B,C,D is given: Pno Allocation Max Available P0 0012 0112 1540 P1 1000 1750 P2 1354 2356 P3 0014 0656 If P1 max is ( 0,3,1,0), whether it can be satisfied? If can, give one safe sequence?
Consider the following growing network model in which each node i is assigned an attractiveness a € N+ drawn from a distribution (a). Let N(t) denote the total number of nodes at time t. At time t = 1 the network is formed by two nodes joined by a link. At every time step a new node joins the network. Every new node has initially a single link that connects it to the rest of the network. - At every time step t the link of the new node is attached to an existing node i of the network chosen with probability II; given by where II₁ = Ꮓ Z = Σ aj. j=1,...,N(t-1) Provide the mean-field solution of the model by considering the following two points. (B) Assume that 7(a) = { 1 for a 1, 0 for a 1, = and that Zāt. Derive the degree distribution P(k) of the network for large times, i.e. t>1, in the mean-field approximation.
Given a graph G (N, A) on which each arc (i, j) E A has an associated value rij, which is a real number in the range of 0 ≤ rij ≤ 1 that represents the reliability of a communication channel from node i to node j. We interpret rij as the probability that the channel from node i to node j will not fail, and we assume that these probabilities are independent. Please formulate this problem as a shortest path problem and solve it using the Dijkstra's algorithm. 1 0.8 0.8 2 3 نیا 0.5 0.6 1 0.8 0.9 5 0.9 0.7
Given a graph G (N, A) on which each arc (i, j) € A has an associated value rij, which is a real number in the range of 0 ≤ y ≤ 1 that represents the reliability of a communication channel from node i to node j. We interpret rij as the probability that the channel from node i to node j will not fail, and we assume that these probabilities are independent. Please formulate this problem as a shortest path problem and solve it using the Dijkstra's algorithm. 0.8 0.8 0.5 0.6 0.8 0.9 0.9 0.7
Implement a convex optimization project for a computer network (use YALMIP and CVXPY Python toolbox to implement the project in Matlab and Python software). Specifically,● Objective function: Energy consumption minimization (energy here includes data execution energy and data offloading energy)● Control variables: ○ Transmit power ○ CPU frequency● Use FDMA as the transmission protocol● Constraints for: ○ Transmit power ○ CPU frequency ○ Total latency
A popular masseuse receives a sequence of back-to-back appointment requestsand is debating which ones to accept. She needs a 15-minute break between appointments andtherefore she cannot accept any adjacent requests. Given a sequence of back-to-back appointment requests (all multiples of 15 minutes, none overlap, and none can be moved), find the optimal(highest total booked minutes) set the masseuse can honor. Return the number of minutes.EXAMPLEInput: {30, 15, 60, 75, 45, 15, 15, 45}Output180 minutes ({30, 60, 45, 45})
A set {Po,Pi,.Pn} of waiting processes must exist such that Po is waiting for a resource held by Pi,Pi is waiting for a resource for a resource held by P2., Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by PO.This condition for deadlock is referred to as a. No Preemption O b. Circular Wait Oc. Mutual Exclusion O d. Hold and Wait
Recall Pigou’s example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction x1 of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T1 = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T2 = 0.25 + 0.75x2. If drivers act in a “selfish” manner – the user optimal scenario – all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate τ the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows x¯1 and ¯x2…

SEE MORE QUESTIONS

Recommended textbooks for you

Operations Research : Applications and Algorithms

Computer Science

ISBN:

9780534380588

Author:

Wayne L. Winston

Publisher:

Brooks Cole

Operations Research : Applications and Algorithms

Computer Science

ISBN:

9780534380588

Author:

Wayne L. Winston

Publisher:

Brooks Cole

SEE MORE TEXTBOOKS