to (miles) from 1 2 3 6 1. 12 17 18 10 20 2. 14 10 19 16 15 3. 14 10 12 8 9 4. 8 16 14 12 15 5. 11 21 16 18 10 6. 24 12 17 15 The agency would like the following number of cars at each lot at the end of the day. Also shown is the number of available cars at each lot at the end of a particular day. De- termine the optimal reallocation of rental cars that will minimize the total mileage. Lot 1 2 3 5 6 Available 42 21 18 23 35 27 Desire 27 26 22 44 31 16
The Sunshine Rental Car Agency has six lots in Orlando,
and it wants to have a certain number of cars available at
each lot at the beginning of each day for local rental. The
agency would like a model it could quickly solve at
the end of each day that would tell how to redistribute the
cars among the six lots at the minimum total mileage.
The distances between the six lots are as follows:
Transporting goods is moving goods from one place to another. These are various types of modes that are used to transport goods. The mode is selected on the basis of different factors related to the good or the seller and buyers' preferences.
The given problem will be solved using the LP technique. Linear programming is a mathematical technique that is commonly used in operations management departments. Each LP problem has the decision variable, objective function, and constraints. By calculating the values the final solution can be calculated.
Find the Given details below:
| Given details: | |||||||
| From | To | ||||||
| 1 | 2 | 3 | 4 | 5 | 6 | Available | |
| 1 | - | 12 | 17 | 18 | 10 | 20 | 42 |
| 2 | 14 | - | 10 | 19 | 16 | 15 | 21 |
| 3 | 14 | 10 | - | 12 | 8 | 9 | 18 |
| 4 | 8 | 16 | 14 | - | 12 | 15 | 23 |
| 5 | 11 | 21 | 16 | 18 | - | 10 | 35 |
| 6 | 24 | 12 | 9 | 17 | 15 | - | 27 |
| Desire | 27 | 26 | 22 | 44 | 31 | 16 | |
Step by step
Solved in 4 steps with 7 images
