Reference no: EM132649919

Question 1: 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,

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.

b) Formulate a Linear Programming (LP) model for the factory that minimises the total cost of producing the beverage while satisfying all constraints.

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?

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 corresponding equation.

d) Is there a range for the cost ($) of A that can be changed without affecting the opti- mum solution obtained above?

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.

The maximal demand (in tons) for each product, the minimum cotton and wool propor- tion in each product is as follows:

a) Formulate an LP model for the factory that maximises the profit, while satisfying the demand and the cotton and wool proportion constraints.

b) Solve the model using R/R Studio. Find the optimal profit and optimal values of the decision variables.

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 player places all of his/her chips in his/her two piles, then compare the number of chips in his/her 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 her P1 and P2, David puts 3 and 1 chips in his P1 and P2, respectively. Then Helen will get 5 (5 vs 3) + 5 (5 vs 1) - 5 (1 vs 3) + 0 (1 vs 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.
(b) Formulate the payoff matrix for the game.
(c) Explain what is a saddle point. Verify: does the game have a saddle point?
(d) Construct a linear programming model for each player in this game.
(e) Produce an appropriate code to solve the linear programming model for this game.
(f) Solve the game for David using the linear programming model you constructed. In- terpret your solution in 3-5 sentences.

[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. After that, each player will obtain $2 at the end. Every player want to maximise his profit, but 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.]

(b) Find the Nash equilibrium of this game. What are the profits at this equilibrium? Explain your reason clearly.

(c) Whether the Nash equilibrium of this game provides the best strategy (Pareto op- timal solution) for all players if they can cooperate? Explain the relationship between Nash Equilibria and Pareto optimality in 3-5 sentences.

(d) Describe a real life example in which the cooperation should be the name of the game.

Attachment:- Real world Analytics.rar