SIT718 - Profit in Cereal Production with Linear Programming Assignment

Assignment Task

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

1. Explain why a linear programming model would be suitable for this case 
2. Formulate a Linear Programming (LP) model for the factory that minimises the total cost of producing the cheese while satisfying all 
3. Use the graphical method to find the optimal 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?
4. Is there a range for the cost ($) of A that can be changed without affecting the opti- mum point obtained above? 
5. A food factory makes three types of cereals, A, B and C, from a mix of several ingredients: Oates, Apricots, Coconuts and Hazelnuts. The cereals are packaged in 1 kg boxes. The following table provides details of the sales price per box of cereals and the production cost per ton (1000 kg) of cereals

The following table provides the purchase price per ton of ingredients and the maximum availability of the ingredients in tons respectively.

The minimum daily demand (in boxes) for each cereal and the proportion of the Oates, Apricots, Coconut and Hazelnuts in each cereal is detailed in the following table,

• Let x_ij ≥ 0 be a decision variable that denotes the number of kg of ingredient i, where i could be Oates, Apricots, Coconuts, Hazelnuts, used to produce Cereal j, here j is one of A,B,C, (in boxes). Formulate an LP model to determine the optimal production mix of cereals and the associated amounts of ingredients that maximises the profit, while satisfying the  

1. Solve the model in R/R Find the optimal profit and optimal values of the decision variables. 

• Two mining companies, Red and Blue, bid for the right to drill a The possible bids are $ 15 Million, $ 25 Million, $ 35 Million, $ 45 Million and $ 50 Million. The winner is the company with the higher bid.

The two companies decide that in the case of a tie (equal bids), Red is the winner and will get the field.

• Company Red has ordered a geological survey and, based on the report from the survey, concludes that getting the field for more than $ 45 Million is as bad as not getting it (assume loss), except in case of a tie (assume win).
• State reasons why/how this game can be described as a two-players-zero-sum game
• Considering all possible combinations of bids, formulate the payoff matrix for the

• Explain what is a saddle Verify: does the game have a saddle point?

• Construct a linear programming model for Company Blue in this

• Produce an appropriate code to solve the linear programming model in part (d). (f) Solve the game for Blue using the linear programming model and the code you con- structed in parts (d) and (e). Interpret your solution.

This It Computer Science have been solved by our PhD Experts at My Uni Paper. Our Assignment Writing Experts are efficient in providing a fresh solution to this question. We are serving more than 10000+ Students in Australia, the UK, and the US by helping them to score HD in their academics. Our Experts are well-trained to follow all marking rubrics and referencing styles.

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