Question: Problem 4 (Matching) Formulate the following problem into an integer linear programming model in order to minimize the total waiting time of customers. The Yellow

Problem 4 (Matching) Formulate the following

Problem 4 (Matching) Formulate the following problem into an integer linear programming model in order to minimize the total waiting time of customers. The Yellow Cab of Irvine has a taxi waiting at each of four cab stands around the city. Four customers have called and requested service. The distance, in minutes, from the waiting taxis to each of the customers is given below: Customer A B D 7 3 4 8 Cab Stand 1 Cab Stand 2 5 4 6 5 Cab Stand 3 6 7 9 6 Cab Stand 4 8 6 7 4 Formulate and solve an LP model. Please define your decision variables, objective function and constraints and label your constraints clearly. You need to show your work in problem formulation, and its implementation in Excel

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 General Management Questions!