Highlights
Unit Learning Outcome (ULO)
ULO1 – assessed through student ability to apply game theory, and linear programming skills and models, to make optimal decisions.
ULO2 - assessed through student ability to develop software codes to solve computational problems for real world analytics.
Graduate Learning Outcome (GLO)
GLO1 - Discipline knowledge and capabilities
GLO2 – Critical thinking
GLO3 – Problem-solving
1. A cheese factory is making a new cheese from mixing two products A and B, each made of three different types of milk - sheep, cow and goat milk. The compositions of A and B and prices ($/kg) are given as follows,

The recipes for the production of the new cheese require that there must be at least 45 litres Cow milk and at least 50 litres of Goat milk per 1000 kg of the cheese
respectively, but no more than 60 litres of Sheep milk per 1000 kg of cheese. The factory needs to produce at least 60 kg of cheese 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 cheese 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 minimal 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?
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.

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. Two mining companies, Company 1 and Company 2, bid for the right to drill a field. The possible bids are $ 10 Million, $ 20 Million, $ 30 Million, $ 40 Million and $ 50 Million. The winner is the company with the higher bid.In case of a tie (equal bids) Company, 1 is the winner and will get the field. For Company 1 getting the field for more than $ 40 Million is as bad as not getting it (assume loss), except in case of a tie (assume win).
(a) State reasons why/how this game can be described as a two-players-zero-sum game
(b) Considering all possible combinations of bids, 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 Company 1 in this game.
(e) Produce an appropriate code to solve the linear programming model in part (d).
(f) Solve the game for Company 1 using the linear programming model you constructed in part (e). Interpret your solution.
This Science and Maths Assignment 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.