7.06d Graphical solution: feasible region, two variables

152 questions

Sort by: Default | Easiest first | Hardest first
OCR MEI D1 2005 June Q6
16 marks Moderate -0.8
6 A company manufactures two types of potting compost, Flowerbase and Growmuch. The weekly amounts produced of each are constrained by the supplies of fibre and of nutrient mix. Each litre of Flowerbase requires 0.75 litres of fibre and 1 kg of nutrient mix. Each litre of Growmuch requires 0.5 litres of fibre and 2 kg of nutrient mix. There are 12000 litres of fibre supplied each week, and 25000 kg of nutrient mix. The profit on Flowerbase is 9 p per litre. The profit on Growmuch is 20 p per litre.
  1. Formulate an LP to maximise the weekly profit subject to the constraints on fibre and nutrient mix.
  2. Solve your LP using a graphical approach.
  3. Consider each of the following separate circumstances.
    (A) There is a reduction in the weekly supply of fibre from 12000 litres to 10000 litres. What effect does this have on profit?
    (B) The price of fibre is increased. Will this affect the optimal production plan? Justify your answer.
    [0pt] (C) The supply of nutrient mix is increased to 30000 kg per week. What is the new profit? [1]
OCR MEI D1 2006 June Q5
16 marks Moderate -0.3
5 John is reviewing his lifestyle, and in particular his leisure commitments. He enjoys badminton and squash, but is not sure whether he should persist with one or both. Both cost money and both take time. Playing badminton costs \(\pounds 3\) per hour and playing squash costs \(\pounds 4\) per hour. John has \(\pounds 11\) per week to spend on these activities. John takes 0.5 hours to recover from every hour of badminton and 0.75 hours to recover from every hour of squash. He has 5 hours in total available per week to play and recover.
  1. Define appropriate variables and formulate two inequalities to model John's constraints.
  2. Draw a graph to represent your inequalities. Give the coordinates of the vertices of your feasible region.
  3. John is not sure how to define an objective function for his problem, but he says that he likes squash "twice as much" as badminton. Letting every hour of badminton be worth one "satisfaction point" define an objective function for John's problem, taking into account his "twice as much" statement.
  4. Solve the resulting LP problem.
  5. Given that badminton and squash courts are charged by the hour, explain why the solution to the LP is not a feasible solution to John's practical problem. Give the best feasible solution.
  6. If instead John had said that he liked badminton more than squash, what would have been his best feasible solution?
OCR MEI D1 2007 June Q3
8 marks Moderate -0.8
3 Use a graphical approach to solve the following LP. $$\begin{aligned} & \text { Maximise } \quad 2 x + 3 y \\ & \text { subject to } \quad x + 5 y \leqslant 14 \\ & \quad x + 2 y \leqslant 8 \\ & \quad 3 x + y \leqslant 21 \\ & \quad x \geqslant 0 \\ & y \geqslant 0 \end{aligned}$$ Section B (48 marks)
OCR MEI D1 2009 June Q3
8 marks Standard +0.3
3 Consider the following linear programming problem:
Maximise \(\quad 3 x + 4 y\) subject to \(\quad 2 x + 5 y \leqslant 60\) \(x + 2 y \leqslant 25\) \(x + y \leqslant 18\)
  1. Graph the inequalities and hence solve the LP.
  2. The right-hand side of the second inequality is increased from 25 . At what new value will this inequality become redundant?
OCR MEI D1 2010 June Q4
16 marks Standard +0.3
4 A wall 4 metres long and 3 metres high is to be tiled. Two sizes of tile are available, 10 cm by 10 cm and 30 cm by 30 cm .
  1. If \(x\) is the number of boxes of ten small tiles used, and \(y\) is the number of large tiles used, explain why \(10 x + 9 y \geqslant 1200\). There are only 100 of the large tiles available.
    The tiler advises that the area tiled with the small tiles should not exceed the area tiled with the large tiles.
  2. Express these two constraints in terms of \(x\) and \(y\). The smaller tiles cost 15 p each and the larger tiles cost \(\pounds 2\) each.
  3. Given that the objective is to minimise the cost of tiling the wall, state the objective function. Use the graphical approach to solve the problem.
  4. Give two other factors which would have to be taken into account in deciding how many of each tile to purchase.
OCR MEI D1 2011 June Q2
8 marks Moderate -0.8
2 The algorithm gives a method for drawing two straight lines, if certain conditions are met. Start with the equations of the two straight lines
Line 1 is \(a x + b y = c , \quad a , b , c > 0\) Line 2 is \(d x + e y = f , \quad d , e , f > 0\) Let \(X =\) minimum of \(\frac { c } { a }\) and \(\frac { f } { d }\) Let \(Y =\) minimum of \(\frac { c } { b }\) and \(\frac { f } { e }\) If \(X = \frac { c } { a }\) then \(X ^ { * } = \frac { c - b Y } { a }\) and \(Y ^ { * } = \frac { f - d X } { e }\) If \(X = \frac { f } { d }\) then \(X ^ { * } = \frac { f - e Y } { d }\) and \(Y ^ { * } = \frac { c - a X } { b }\) Draw an \(x\)-axis labelled from 0 to \(X\), and a \(y\)-axis labelled from 0 to \(Y\) Join ( \(0 , Y\) ) to ( \(X , Y ^ { * }\) ) with a straight line
Join ( \(X ^ { * } , Y\) ) to ( \(X , 0\) ) with a straight line
  1. Apply the algorithm with \(a = 1 , b = 5 , c = 25 , d = 10 , e = 2 , f = 85\).
  2. Why might this algorithm be useful in an LP question?
OCR MEI D1 2011 June Q4
16 marks Moderate -0.3
4 An eco-village is to be constructed consisting of large houses and standard houses.
Each large house has 4 bedrooms, needs a plot size of \(200 \mathrm {~m} ^ { 2 }\) and costs \(\pounds 60000\) to build.
Each standard house has 3 bedrooms, needs a plot size of \(120 \mathrm {~m} ^ { 2 }\) and costs \(\pounds 50000\) to build.
The area of land available for houses is \(120000 \mathrm {~m} ^ { 2 }\). The project has been allocated a construction budget of \(\pounds 42.4\) million. The market will not sustain more than half as many large houses as standard houses. So, for instance, if there are 500 standard houses then there must be no more than 250 large houses.
  1. Define two variables so that the three constraints can be formulated in terms of your variables. Formulate the three constraints in terms of your variables.
  2. Graph your three inequalities from part (i), indicating the feasible region.
  3. Find the maximum number of bedrooms which can be provided, and the corresponding numbers of each type of house.
  4. Modify your solution if the construction budget is increased to \(\pounds 45\) million.
OCR MEI D1 2012 June Q4
16 marks Moderate -0.3
4 In a factory, two types of motor are made. Each motor of type X takes 10 man hours to make and each motor of type Y takes 12 man hours to make. In each week there are 200 man hours available. To satisfy customer demand, at least 5 of each type of motor must be made each week.
Once a motor has been started it must be completed; no unfinished motors may be left in the factory at the end of each week. When completed, the motors are put into a container for shipping. The volume of the container is \(7 \mathrm {~m} ^ { 3 }\). A type X motor occupies a volume of \(0.5 \mathrm {~m} ^ { 3 }\) and a type Y motor occupies a volume of \(0.3 \mathrm {~m} ^ { 3 }\).
  1. Define appropriate variables and from the above information derive four inequalities which must be satisfied by those variables.
  2. Represent your inequalities on a graph and shade the infeasible region. The profit on each type X is \(\pounds 100\) and on each type Y is \(\pounds 70\).
  3. The weekly profit is to be maximised. Write down the objective function and find the maximum profit.
  4. Because of absenteeism, the manager decides to organise the work in the factory on the assumption that there will be only 180 man hours available each week. Find the number of motors of each type that should now be made in order to maximise the profit.
OCR MEI D1 2014 June Q6
16 marks Moderate -0.3
6 Ian the chef is to make vegetable stew and vegetable soup for distribution to a small chain of vegetarian restaurants. The recipes for both of these require carrots, beans and tomatoes. 10 litres of stew requires 1.5 kg of carrots, 1 kg of beans and 1.5 kg of tomatoes.
10 litres of soup requires 1 kg of carrots, 0.75 kg of beans and 1.5 kg of tomatoes. Ian has available 100 kg of carrots, 70 kg of beans and 110 kg of tomatoes.
  1. Identify appropriate variables and write down three inequalities corresponding to the availabilities of carrots, beans and tomatoes.
  2. Graph your inequalities and identify the region corresponding to feasible production plans. The profit on a litre of stew is \(\pounds 5\), and the profit on a litre of soup is \(\pounds 4\).
  3. Find the most profitable production plan, showing your working. Give the maximum profit. Ian can buy in extra tomatoes at \(\pounds 2.50\) per kg .
  4. What extra quantity of tomatoes should Ian buy? How much extra profit would be generated by the extra expenditure? \section*{END OF QUESTION PAPER} \section*{OCR}
OCR MEI D1 2015 June Q3
8 marks Moderate -0.8
3 Mary takes over a small café. She will sell two types of hot drink: tea and coffee.
A coffee filter costs her \(\pounds 0.10\), and makes one cup of coffee. A tea bag costs her \(\pounds 0.05\) and makes one cup of tea. She has a total weekly budget of \(\pounds 50\) to spend on coffee filters and tea bags. She anticipates selling at least 500 cups of hot drink per week. She estimates that between \(50 \%\) and \(75 \%\) of her sales of cups of hot drink will be for cups of coffee. Mary needs help to decide how many coffee filters and how many tea bags to buy per week.
  1. Explain why the number of tea bags which she buys should be no more than the number of coffee filters, and why it should be no less than one third of the number of coffee filters.
  2. Allocate appropriate variables, and draw a graph showing the feasible region for Mary's problem. Mary's partner suggests that she buys 375 coffee filters and 250 tea bags.
  3. How does this suggestion relate to the estimated demand for coffee and tea?
OCR MEI D1 2016 June Q4
16 marks Moderate -0.3
4 Two products are to be made from material that is supplied in a single roll, 20 m long and 1 m wide. The two products require widths of 47 cm and 32 cm respectively. Two ways of cutting lengths of material are shown in the plans below. \includegraphics[max width=\textwidth, alt={}, center]{e88abde1-8769-4a3c-b115-031cea08d9a6-5_408_1538_520_269} \includegraphics[max width=\textwidth, alt={}, center]{e88abde1-8769-4a3c-b115-031cea08d9a6-5_403_1533_952_274}
  1. Given that there should be no unnecessary waste, draw one other cutting plan that might be used for a cut of length \(z\) metres.
  2. Write down an expression for the total area that is wasted in terms of \(x , y\) and \(z\). All of the roll is to be cut, so \(x + y + z = 20\).
    There needs to be a total length of at least 20 metres of the material for the first product, the one requiring width 47 cm .
  3. Write this as a linear constraint on the variables. There needs to be a total length of at least 24 metres of the material for the second product, the one requiring width 32 cm .
  4. Write this as a linear constraint on the variables.
  5. Formulate an LP in terms of \(x\) and \(y\) to minimise the area that is wasted. You will need to use the relationship \(x + y + z = 20\), together with your answers to parts (ii), (iii) and (iv).
  6. Solve your LP graphically, and interpret the solution.
Edexcel D1 Q6
14 marks Moderate -0.5
6. The manager of a new leisure complex needs to maximise the Revenue \(( \pounds R )\) from providing the following two weekend programmes.
\(\frac { \text { Participants } } { \text { Children } }\)7 hours windsurfing, 2 hours sailing\(\frac { \text { Revenue } } { \pounds 50 }\)
Adults5 hours windsurfing, 6 hours sailing\(\pounds 100\)
The following restrictions apply to each weekend.
No more than 90 participants can be accommodated.
There must be at most 40 adults.
A maximum of 600 person-hours of windsurfing can be offered.
A maximum of 300 person-hours of sailing can be offered.
  1. Formulate the above information as a linear programming problem, listing the constraints as inequalities and stating the objective function \(R\).
  2. On graph paper, illustrate the constraints, indicating clearly the feasible region.
  3. Solve the problem graphically, stating how many adults and how many children should be accepted each weekend and what the revenue will be. The manager is considering buying more windsurfing equipment at a cost of \(\pounds 2000\). This would increase windsurfing provision by \(10 \%\).
  4. State, with a reason, whether such a purchase would be cost effective.
Edexcel D2 2002 June Q9
17 marks Moderate -0.5
9. T42 Co. Ltd produces three different blends of tea, Morning, Afternoon and Evening. The teas must be processed, blended and then packed for distribution. The table below shows the time taken, in hours, for each stage of the production of a tonne of tea. It also shows the profit, in hundreds of pounds, on each tonne.
\cline { 2 - 5 } \multicolumn{1}{c|}{}ProcessingBlendingPackingProfit ( \(\pounds 100\) )
Morning blend3124
Afternoon blend2345
Evening blend4233
The total times available each week for processing, blending and packing are 35, 20 and 24 hours respectively. T42 Co. Ltd wishes to maximise the weekly profit. Let \(x , y\) and \(z\) be the number of tonnes of Morning, Afternoon and Evening blend produced each week.
  1. Formulate the above situation as a linear programming problem, listing clearly the objective function, and the constraints as inequalities.
    (4) An initial Simplex tableau for the above situation is
    Basic
    variable
    \(x\)\(y\)\(z\)\(r\)\(s\)\(t\)Value
    \(r\)32410035
    \(s\)13201020
    \(t\)24300124
    \(P\)- 4- 5- 30000
  2. Solve this linear programming problem using the Simplex algorithm. Take the most negative number in the profit row to indicate the pivot column at each stage. T42 Co. Ltd wishes to increase its profit further and is prepared to increase the time available for processing or blending or packing or any two of these three.
  3. Use your answer to part (b) to advise the company as to which stage(s) it should increase the time available.
Edexcel D2 2012 June Q3
12 marks Moderate -0.5
3. The table below shows the cost, in pounds, of transporting one tonne of concrete from each of three supply depots, \(\mathrm { A } , \mathrm { B }\) and C , to each of four building sites, \(\mathrm { D } , \mathrm { E } , \mathrm { F }\) and G . It also shows the number of tonnes that can be supplied from each depot and the number of tonnes required at each building site. A minimum cost solution is required.
DEFGSupply
A1719212018
B2120192223
C1817162129
Demand15241813
The north-west corner method gives the following possible solution.
DEFGSupply
A15318
B21223
C161329
Demand15241813
Taking AG as the first entering cell,
  1. use the stepping stone method twice to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, routes, entering cells and exiting cells.
  2. Determine whether your current solution is optimal. Justify your answer.
Edexcel D2 2013 June Q1
10 marks Moderate -0.8
  1. Four workers, Chris (C), James (J), Katie (K) and Nicky (N), are to be allocated to four tasks, 1, 2, 3 and 4. Each worker is to be allocated to one task and each task must be allocated to one worker.
The profit, in pounds, resulting from allocating each worker to each task, is shown in the table below. The profit is to be maximised.
1234
Chris127116111113
James225208205208
Katie130113112114
Nicky228212203210
  1. Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total profit. You must make your method clear and show the table after each stage.
  2. State which worker should be allocated to each task and the resulting total profit made.
Edexcel D2 2013 June Q3
8 marks Moderate -0.5
3. Table 1 below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, \(\mathrm { A } , \mathrm { B } , \mathrm { C }\) and D , to four demand points \(1,2,3\) and 4 . It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required. \begin{table}[h]
1234Supply
A2236193735
B2935303615
C2432254120
D2330233830
Demand30203020
\captionsetup{labelformat=empty} \caption{Table 1}
\end{table} Table 2 shows an initial solution given by the north-west corner method.
Table 3 shows some of the improvement indices for this solution. \begin{table}[h]
1234
A305
B150
C20
D1020
\captionsetup{labelformat=empty} \caption{Table 2}
\end{table} \begin{table}[h]
1234
Axx
Bxx
C82x1
D92xx
\captionsetup{labelformat=empty} \caption{Table 3}
\end{table}
  1. Explain why a zero has been placed in cell B3 in Table 2.
    (1)
  2. Calculate the shadow costs and the missing improvement indices and enter them into Table 3 in your answer book.
  3. Taking the most negative improvement index to indicate the entering cell, state the steppingstone route that should be used to obtain the next solution. You must state your entering cell and exiting cell.
Edexcel D2 2013 June Q2
10 marks Moderate -0.3
2. The table shows the cost, in pounds, of transporting one unit of stock from each of four supply points, \(\mathrm { A } , \mathrm { B } , \mathrm { C }\) and D , to each of three demand points, 1, 2 and 3 . It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required.
123Supply
A10112018
B1571314
C24151221
D9211812
Demand271820
  1. Use the north-west corner method to obtain an initial solution.
    (1)
  2. Taking D1 as the entering cell, use the stepping stone method to find an improved solution. Make your route clear.
    (2)
  3. Perform one further iteration of the stepping stone method to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, route, entering cell and exiting cell.
  4. Determine whether your current solution is optimal, giving a reason for your answer.
Edexcel D2 2014 June Q1
10 marks Standard +0.3
  1. Four bakeries, \(\mathrm { A } , \mathrm { B } , \mathrm { C }\) and D , supply bread to four supermarkets, \(\mathrm { P } , \mathrm { Q } , \mathrm { R }\) and S . The table gives the cost, in pounds, of transporting one lorry load of bread from each bakery to each supermarket. It also shows the number of lorry loads of bread at each bakery and the number of lorry loads of bread required at each supermarket. The total cost of transportation is to be minimised.
PQRSSupply
A2832332713
B312926314
C3026293212
D2530283411
Demand1110118
  1. Use the north-west corner method to obtain a possible solution. A partly completed table of improvement indices is given in Table 1 in the answer book.
  2. Complete Table 1.
  3. Taking the most negative improvement index to indicate the entering cell, use the steppingstone method once to obtain an improved solution. You must make your route clear and state your entering cell and exiting cell.
  4. State the cost of your improved solution.
Edexcel D2 Q2
9 marks Moderate -0.3
2. The following transportation problem is to be solved.
\(P\)\(Q\)\(R\)Supply
\(A\)75712
\(B\)5657
\(C\)1412911
Demand10911
A possible north-west corner solution is:
\(P\)\(Q\)\(R\)
\(A\)102
\(B\)70
\(C\)11
  1. Use the stepping-stone method once to obtain an improved solution. You must make your shadow costs, improvement indices, entering cell, exiting cell and stepping-stone route clear.
  2. Demonstrate that your solution is optimal.
    (3)
Edexcel D2 Specimen Q3
11 marks Moderate -0.5
3. Freezy Co. has three factories \(A , B\) and \(C\). It supplies freezers to three shops \(D , E\) and \(F\). The table shows the transportation cost in pounds of moving one freezer from each factory to each outlet. It also shows the number of freezers available for delivery at each factory and the number of freezers required at each shop. The total number of freezers required is equal to the total number of freezers available.
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(D\)\(E\)\(F\)Available
\(A\)21241624
\(B\)18231732
\(C\)15192514
Required203020
\cline { 1 - 4 }
\cline { 1 - 4 }
  1. Use the north-west corner rule to find an initial solution.
  2. Obtain improvement indices for each unused route.
  3. Use the stepping-stone method once to obtain a better solution and state its cost.
Edexcel D2 Specimen Q7
15 marks Moderate -0.5
7. Four salespersons \(A , B , C\) and \(D\) are to be sent to visit four companies 1,2,3 and 4. Each salesperson will visit exactly one company, and all companies will be visited.
Previous sales figures show that each salesperson will make sales of different values, depending on the company that they visit. These values (in \(\pounds 10000\) s) are shown in the table below.
\cline { 2 - 5 } \multicolumn{1}{c|}{}1234
Ann26303030
Brenda30232629
Connor30252724
Dave30272521
  1. Use the Hungarian algorithm to obtain an allocation that maximises the sales. You must make your method clear and show the table after each stage.
  2. State the value of the maximum sales.
  3. Show that there is a second allocation that maximises the sales.
OCR D2 2006 January Q4
13 marks Moderate -0.8
4 Four workers, \(A , B , C\) and \(D\), are to be allocated, one to each of the four jobs, \(W , X , Y\) and \(Z\). The table shows how much each worker would charge for each job. \includegraphics[max width=\textwidth, alt={}, center]{9c9b1a42-8d16-446a-85a1-4c08e5e368be-3_401_846_1745_642}
  1. What is the total cost of the four jobs if \(A\) does \(W , B\) does \(X , C\) does \(Y\) and \(D\) does \(Z\) ?
  2. Apply the Hungarian algorithm to the table, reducing rows first. Show all your working and explain each step. Give the resulting allocation and the total cost of the four jobs with this allocation.
  3. What problem does the Hungarian algorithm solve?
OCR D2 2007 January Q1
8 marks Moderate -0.8
1 Four friends have rented a house and need to decide who will have which bedroom. The table below shows how each friend rated each room, so the higher the rating the more the room was liked.
Attic
room
Back
room
Downstairs
room
Front
room
Phil5104
Rob1612
Sam4223
Tim3500
The Hungarian algorithm is to be used to find the matching with the greatest total. Before the Hungarian algorithm can be used, each rating is subtracted from 6.
  1. Explain why the ratings could not be used as given in the table.
  2. Apply the Hungarian algorithm, reducing rows first, to match the friends to the rooms. You must show your working and say how each matrix was formed.
OCR D2 2012 January Q6
13 marks Moderate -0.5
6 Rowena and Colin play a game in which each chooses a letter. The table shows how many points Rowena wins for each combination of letters. In each case the number of points that Colin wins is the negative of the entry in the table. Both Rowena and Colin are trying to win as many points as possible. Colin's letter \begin{table}[h]
\captionsetup{labelformat=empty} \caption{Rowena's letter}
\(N\)\(P\)\(Q\)\(T\)
\(W\)4- 11- 2
\(X\)13- 11
\(Y\)512- 1
\(Z\)0- 111
\end{table}
  1. Write down Colin's play-safe strategy, showing your working. What is the maximum number of points that Colin can win if he plays safe?
  2. Explain why Rowena would never choose the letter \(W\). Rowena uses random numbers to choose between her three remaining options, so that she chooses \(X , Y\) and \(Z\) with probabilities \(x , y\) and \(z\), respectively. Rowena then models the problem of which letter she should choose as the following LP. $$\begin{array} { c l } \text { Maximise } & M = m - 1 \\ \text { subject to } & m \leqslant 2 x + 6 y + z , \\ & m \leqslant 4 x + 2 y , \\ & m \leqslant 3 y + 2 z , \\ & m \leqslant 2 x + 2 z , \\ & x + y + z \leqslant 1 \\ \text { and } & m \geqslant 0 , x \geqslant 0 , y \geqslant 0 , z \geqslant 0 \end{array}$$
  3. Show how the expression \(2 x + 6 y + z\) was formed. The Simplex algorithm is used to solve the LP problem. The solution has \(x = 0.3 , y = 0.2\) and \(z = 0.5\).
  4. Show that the optimal value of \(M\) is 0.6 . Colin then models the problem of which letter he should choose in a similar way. When Rowena plays using her optimal solution, from above, Colin finds that he should never choose the letter \(N\). Letting \(p , q\) and \(t\) denote the probabilities that he chooses \(P , Q\) and \(T\), respectively, Colin obtains the following equations. $$- 3 p + q - t = - 0.6 \quad - p - 2 q + t = - 0.6 \quad p - q - t = - 0.6 \quad p + q + t = 1$$
  5. Explain how the equation \(- 3 p + q - t = - 0.6\) is obtained.
  6. Use the third and fourth equations to find the value of \(p\). Hence find the values of \(q\) and \(t\).
OCR MEI D2 2006 June Q4
20 marks Standard +0.3
4 The "Cuddly Friends Company" produces soft toys. For one day's production run it has available \(11 \mathrm {~m} ^ { 2 }\) of furry material, \(24 \mathrm {~m} ^ { 2 }\) of woolly material and 30 glass eyes. It has three soft toys which it can produce: The "Cuddly Aardvark", each of which requires \(0.5 \mathrm {~m} ^ { 2 }\) of furry material, \(2 \mathrm {~m} ^ { 2 }\) of woolly material and two eyes. Each sells at a profit of \(\pounds 3\). The "Cuddly Bear", each of which requires \(1 \mathrm {~m} ^ { 2 }\) of furry material, \(1.5 \mathrm {~m} ^ { 2 }\) of woolly material and two eyes. Each sells at a profit of \(\pounds 5\). The "Cuddly Cat", each of which requires \(1 \mathrm {~m} ^ { 2 }\) of furry material, \(1 \mathrm {~m} ^ { 2 }\) of woolly material and two eyes. Each sells at a profit of \(\pounds 2\). An analyst formulates the following LP to find the production plan which maximises profit. $$\begin{array} { l l } \text { Maximise } & 3 a + 5 b + 2 c \\ \text { subject to } & 0.5 a + b + c \leqslant 11 , \\ & 2 a + 1.5 b + c \leqslant 24 , \\ & 2 a + 2 b + 2 c \leqslant 30 . \end{array}$$
  1. Explain how this formulation models the problem, and say why the analyst has not simplified the last inequality to \(a + b + c \leqslant 15\).
  2. The final constraint is different from the others in that the resource is integer valued. Explain why that does not impose an additional difficulty for this problem.
  3. Solve this problem using the simplex algorithm. Interpret your solution and say what resources are left over. On a particular day an order is received for two Cuddly Cats, and the extra constraint \(c \geqslant 2\) is added to the formulation.
  4. Set up an initial simplex tableau to deal with the modified problem using either the big-M approach or two-phase simplex. Do not perform any iterations on your tableau.
  5. Show that the solution given by \(a = 8 , b = 2\) and \(c = 5\) uses all of the resources, but that \(a = 6 , b = 6\) and \(c = 2\) gives more profit. What resources are left over from the latter solution?