Reference no: EM132532230

Case 1
Recycling is an important and complex activity in Country A. To enable timely operations, the country is divided into 10 sectors and recycling operations are commenced simultaneously in each sector. The recyclable garbage is collected from public bins, loaded into trucks, and transported to recycling sites. Each site can accommodate different amounts of recyclable garbage because of its available land size at the facility. The annual capacities for five recycling sites are given in the table below (in megatonnes):

Each recycling site is installed with facilities that have different recycling efficiencies which are summarised in the table below (in percentages):

The cost of collecting and transporting recyclable garbage primarily depends on the distance between the sectors and the recycling sites. The following table summarises the distances between each sector and each recycling site (in kilometres):

Using historical data, the country estimates the annual volume of the recyclable garbage for each sector in the coming year shown in the table below (in megatonnes):

Estimated Recyclable Garbage

It will cost approximately $113,918 to move one megatonne of recycling garbage for one kilometre. The management would like to maximise the amount of recycled garbage and minimise the transportation cost.
a. Formulate a multiple-objective linear programming (MOLP) model for this problem in a Word file with a brief description of an equation, and implement it in an Excel spreadsheet.
b. Determine the optimal value for each objective in the problem.
c. Suppose the management considers maximising the amount of recycled garbage to be two times as important as minimising the transportation cost. Formulate a GP model to optimise both objectives simultaneously with a brief description of an equation in a Word file, and implement the MOLP model in an Excel spreadsheet. What do the results suggest?

Case 2
Company B is a retailer of mobile phones in Australia that works 250 days in a year. The manager is determining a minimum-cost inventory plan for an upcoming phone to be launched in the market. She has collected the following information:
• Annual demand: 900 phones
• Phone cost: $1,079 each
• Phone RRP: $1,199 each
• Net weight: 163 g each
• Tare weight: 277 g each
• Annual inventory holding cost: 15%
• Cost per order to replenish inventory: $75
• Annual in-transit holding cost: 10%
• Freight rate: $7.50 per kg
• Time to process order for freight: 1 days
• Freight transit time: 3 days

Solve this problem using a non-linear programming (NLP) model to determine the followings:
a. Economic order quantity for the phone in units and in kg
b. The total cost for purchasing the phones
c. The total cost for ordering
d. The total cost for holding the inventory
e. The total cost for transportation
f. The total cost for holding the phones during transit
g. The total cost for this inventory plan
h. The number of orders
i. Ordering point
j. The profit from this inventory plan

Case 3
Paul is planning to buy a new car for his work as a trader. After narrowing his choices down to three models (X, Y, and Z) within his budget, he is having difficulty in deciding which one to purchase. He has compared each model against one another on the basis of four criteria: price, safety, economy, and comfort. His comparisons are summarised below:

Paul wants to incorporate all of the four criteria into his final decision. However, the criteria are not equally important. The following matrix summarises his comparisons of the importance of the criteria:

Use analytic hierarchy process to compute the overall score for each car. What do the results suggest?