Highlights
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?
d) Is there a range for the cost ($) of A that can be changed without affecting the optimum solution obtained above?
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.
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 5 chips. Each player places 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 4 and 1 chips in his P1 and P2, respectively. Then Helen will get 5 (5 vs 4) + 5 (5 vs 1) - 5 (1 vs 4) + 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 in part (c).
(f) Solve the game for David using the linear programming model you constructed in part
(c). Interpret your solution.
(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.]
4. If there are two companies making the same model of cellphones. Assuming the demand for the cellphones produced by Company 1 is Q1, and the demand for the cellphones produced by Company 2 is Q2, are described by the following functions:
Q1 = 200 − P1 − (P1 − P ?) (1)
Q2 = 200 − P2 − (P2 − P ?) (2)
where P ? is the average price over the prices of the two companies. Each company has the cost of C = 15 for producing one cellphone. Suppose each company can only choose one of the three prices {70, 80, 90} for sale.
(a) Compute the profits of each company under all sale price combinations and make the payoff matrix for the two companies. [Hint: the total profits = the demand for the
cellphones × the profit of one cellphone after-sale.]
(b) Find the Nash equilibrium of this game. What are the profits at this equilibrium? Explain your reason clearly.
(C) If the cost C = 40, would your the Nash equilibrium change? Why?
This SIT718: Science and Maths Assessment has been solved by our Science and Maths experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.
© Copyright 2026 My Uni Papers – Student Hustle Made Hassle Free. All rights reserved.