Great Deal! Get Instant $10 FREE in Account on First Order + 10% Cashback on Every Order Order Now

SIT718 Real world Analytics Assessment Task 3 Total Marks = 100, Weighting - 30% Your final submission should consist of: 1. “name-report.pdf”: A pdf file (created in any word processor) with up to 8...

1 answer below »
SIT718 Real world Analytics
Assessment Task 3
Total Marks = 100, Weighting - 30%
Your final submission should consist of:
1. “name-report.pdf”: A pdf file (created in any word processor) with up to 8 pages, con-
taining the solutions of the questions, labelled with your name;
2. “name-code.R”: Two codes combined in one with your R file, labelled with yourname.R,
with lp models for Questions 2 and Questions 3.
Your assignment will not be assessed if we cannot reproduce your results with your R
code.
Reference style: Harvard.
1
1. A food factory is making a beverage for a customer from mixing two different existing
products A and B. The compositions of A and B and prices ($/L) are given as follows,
Amount (L) in /100 L of A and B
Lime Orange Mango Cost ($/L)
A XXXXXXXXXX
B XXXXXXXXXX
The customer requires that there must be at least 4.5 Litres (L) Orange and at least
5 Litres of Mango concentrate per 100 Litres of the beverage respectively, but no more
than 6 Litres of Lime concentrate per 100 Litres of beverage. The customer needs at
least 100 Litres of the beverage per week.
a) Explain why a linear programming model would be suitable for this case study.
[5 marks]
) Formulate a Linear Programming (LP) model for the factory that minimises the total
cost of producing the beverage while satisfying all constraints.
[10 marks]
c) Use the graphical method to find the optimal solution. Show the feasible region and
the optimal solution on the graph. Annotate all lines on your graph. What is the mini-
mal cost for the product?
[10 marks]
Note: you can use graphical solvers available online but make sure that your graph is
clear, all variables involved are clearly represented and annotated, and each line is clearly
marked and related to the co
esponding equation.
d) Is there a range for the cost ($) of A that can be changed without affecting the opti-
mum solution obtained above?
[5 marks]
2. A factory makes three products called Spring, Autumn, and Winter, from three materials
containing Cotton, Wool and Silk. The following table provides details on the sales price,
production cost and purchase cost per ton of products and materials respectively.
Sales price Production cost Purchase price
Spring $60 $5 Cotton $30
Autumn $55 $4 Wool $45
Winter $60 $5 Silk $50
The maximal demand (in tons) for each product, the minimum cotton and wool propor-
tion in each product is as follows:
Demand min Cotton proportion min Wool proportion
Spring XXXXXXXXXX% 30%
Autumn XXXXXXXXXX% 40%
Winter XXXXXXXXXX% 50%
a) Formulate an LP model for the factory that maximises the profit, while satisfying the
demand and the cotton and wool proportion constraints.
[10 Marks]
) Solve the model using R/R Studio. Find the optimal profit and optimal values of the
decision variables.
[10 Marks]
Hints:
You may refer to Week 8.7 Example - Blending Crude Oils into Gasolines. For ex-
ample, let xij ≥ 0 be a decision variable that denotes the number of tons of products
j for j ∈ {1 = Spring, 2 = Autumn, 3 = Winter} to be produced from Materials
i ∈ {C=Cotton, W=Wool, S=Silk}.
3. Helen and David are playing a game by putting chips in two piles (each player has two
piles P1 and P2), respectively. Helen has 6 chips and David has 4 chips. Each playe
places all of his/her chips in his/her two piles, then compare the number of chips in his/he
two piles with that of the other player’s two piles. Note that once a chip is placed in one
pile it cannot be moved to another pile. There are four comparisons including Helen’s
P1 vs David’s P1, Helen’s P1 vs David’s P2, Helen’s P2 vs David’s P1, and Helen’s P2
vs David’s P2. For each comparison, the player with more chips in the pile will score 5
point (the opponent will lose 5 point). If the number of chips is the same in the two piles,
then nobody will score any points from this comparison. The final score of the game is
the sum score over the four comparisons. For example, if Helen puts 5 and 1 chips in he
P1 and P2, David puts 3 and 1 chips in his P1 and P2, respectively. Then Helen will get
5 (5 vs XXXXXXXXXXvs XXXXXXXXXXvs XXXXXXXXXXvs 1) = 5 as her final score, and David will get
his final score of -5.
(a) Give reasons why/how this game can be described as a two-players-zero-sum game.
[5 Marks]
(b) Formulate the payoff matrix for the game.
[5 Marks]
(c) Explain what is a saddle point. Verify: does the game have a saddle point?
[5 Marks]
(d) Construct a linear programming model for each player in this game.
[5 Marks]
(e) Produce an appropriate code to solve the linear programming model for this game.
[5 Marks]
(f) Solve the game for David using the linear programming model you constructed. In-
terpret your solution in 3-5 sentences.
[5 Marks]
[Hint: To record the number of chips in each pile for each player you may use the notation
(i, j), where i is the number of chips in P1 and j is the number of chips in P2, for example
(2,4) means two chips in P1 and four chips in P2. Note that one pile could be empty.]
4. Supposing there are three players, each player is given a bag and asked to contribute in
his own money with one of the three amount {$0, $3, $6}. A referee collects all the money
from the three bags and then doubles the amount using additional money. Finally, each
player share the whole money equally. For example, if both Players 1 and 2 put $0 and
Player 3 puts $3, then the referee adds another $3 so that the total becomes $6. Afte
that, each player will obtain $2 at the end. Every player want to maximise his profit,
ut he does not know the amount contributed from other players. [Hint: profit = money
he obtained - money he contributed.]
(a) Compute the profits of each player under all strategy combinations and make the
payoff matrix for the three players. [Hint: you can create multiple payoff tables to
demonstrate the strategy combinations. The referee is not a player and should not be in
the payoff table.]
[5 Marks]
(b) Find the Nash equili
ium of this game. What are the profits at this equili
ium?
Explain your reason clearly.
[5 Marks]
(c) Whether the Nash equili
ium of this game provides the best strategy (Pareto op-
timal solution) for all players if they can cooperate? Explain the relationship between
Nash Equili
ia and Pareto optimality in 3-5 sentences.
[5 Marks]
(d) Describe a real life example in which the cooperation should be the name of the game.
[5 Marks]
Answered Same Day Sep 27, 2021 SIT718

Solution

Naveen answered on Sep 30 2021
142 Votes
Question1:
A. Lp model:
I have crated one objective function which will has to optimized or diminished and also there are some constraints which we need to consider in the model of LP.
These are the important features which I considered in the function this is a linear programming problem.
B. Formulating Linear programming problem:
x1is the total number of liters for product A.
x2is the total number of liters for product B.
Objective function:
Here we are taking or constructing the objective function aim to minimizing the cost.
Objective function is: 5x1+6x2
Equation for a minimum of 4.5 liters of orange is (6x1 + 4x2)/100 ≥ 4.5x2 ≥ (450 – 6x1) / 4
Equation for a minimum of 5 liters of mango is (4x1 + 6x2)/100 ≥5x2 ≥ (500 – 4x1) / 6
Equation for not more than 6 liters of lime is (3x1 + 8x2)/100≤ 6 x2 ≤ (600 – 3x1) / 8
Equation for the customer needs at least 70 liters of the beverage every week is x1 + x2 ≥ 70 x2 ≥ 70 – x1
Here the value of x and y cannot be negative so, we need to take 2 more constraints equations are:
    x1 ≥ 0
    x2≥ 0
x1 ≥ 0 remains the same because there is no variable x2 in the above equation that is needed to be solved.
The equations to be plotted on the graph are:
x2 ≤ (450 – 6x1) / 4
x2 ≤ (500 – 4x1) / 6
x2 ≥ (600 – 3x1) / 8
x2 ≤ 70 – x1
x1 ≤ 0
x2 ≤ 0
C. Finding the optimal solution using graphical method.
From the above graphs the first graph is showing the complete picture without showing any points of ending for the required region.
In the second graph the region is showing full view with the ending points of the region.
The end points:
(200, 0)
(125, 0)
(35, 60)
(33.333, 62.5)
By substituting the above end point in the objective function we can get the cost as follows.
The point (200, 0) gives a cost of 1000
The point (125, 0) givesa cost of 625
The point (35, 60) givesa price of 535
The point (33.333, 62.5) givesa price of 541.665
Here we are getting minimum cost at the point (35,60)
D. Finding is there range for the cost($)
From the above picture of excel calculation we are getting minimum cost at (35, 60).
Cost for each liter of the product A and cost for every liter of product A is equal to 9 then the points lies between (35, 60) and (33.333, 62.5). At the point (33.333, 62.5) there is minimum cost if the cost for each liter of the product A is greater than 9.
Question 2:
A. Formulating an LP model
Here we are having the three variables for the problem which is given below.
    x = the no. of tons of spring produced
    y =...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here