Scribd
Upload
296 views

Lin Prog

D1 Linear Programming Assessment A The Young Enterprise Company "Decide" must produce at least 200 badges but no more than 500 badges. Badge 1 reads "I made the decision to do maths" and Badge 2 reads "Maths is the right decision". The company makes a profit of 30p on Badge 1 and 40p on Badge 2. The problem is formulated as a linear program to maximize total profit with constraints on the number of each badge produced. The feasible region is graphed and the optimal numbers of each badge to produce, which maximizes profit at £190, are identified.

Uploaded by

Illingworth1000
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
296 views

Lin Prog

D1 Linear Programming Assessment A The Young Enterprise Company "Decide" must produce at least 200 badges but no more than 500 badges. Badge 1 reads "I made the decision to do maths" and Badge 2 reads "Maths is the right decision". The company makes a profit of 30p on Badge 1 and 40p on Badge 2. The problem is formulated as a linear program to maximize total profit with constraints on the number of each badge produced. The feasible region is graphed and the optimal numbers of each badge to produce, which maximizes profit at £190, are identified.

Uploaded by

Illingworth1000
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
You are on page 1/ 7

D1 Linear Programming Assessment A

1. The Young Enterprise Company Decide, is going to produce badges to sell to decision maths students. It will produce two types of badges. Badge 1 reads I made the decision to do maths and Badge 2 reads Maths is the right decision. Decide must produce at least 200 badges and has enough material for 500 badges. Market research suggests that the number produced of Badge 1 should be between 20% and 40% of the total number of badges made. The company makes a profit of 30p on each Badge 1 sold and 40p on each Badge 2. It will sell all that it produced, and wishes to maximise its profit. Let x be the number produced of Badge 1 and y be the number of Badge 2. (a) Formulate this situation as a linear programming problem, simplifying your inequalities so that all the coefficients are integers.
(6)

(b) (c)

On the a peice of graph paper construct and clearly label the feasible region.
(5)

Using your graph, advise the company on the number of each badge it should produce. State the maximum profit Decide will make.
(3) (Total 14 marks)

Churston Ferrers Grammar School

D1 Linear Programming Assessment B


2. A company produces two types of party bag, Infant and Junior. Both types of bag contain a balloon, a toy and a whistle. In addition the Infant bag contains 3 sweets and 3 stickers and the Junior bag contains 10 sweets and 2 stickers. The sweets and stickers are produced in the company's factory. The factory can produce up to 3000 sweets per hour and 1200 stickers per hour. The company buys a large supply of balloons, toys and whistles.

Market research indicates that at least twice as many Infant bags as Junior bags should be produced. Both types of party bag are sold at a profit of 15p per bag. All the bags are sold. The company wishes to maximise its profit. Let x be the number of Infant bags produced and y be the number of Junior bags produced per hour. (a) (b) Formulate the above situation as a linear programming problem.
(5)

Represent your inequalities graphically, indicating clearly the feasible region.


(6)

(c)

Find the number of Infant bags and Junior bags that should be produced each hour and the maximum hourly profit. Make your method clear.
(3)

In order to increase the profit further, the company decides to buy additional equipment. It can buy equipment to increase the production of either sweets or stickers, but not both. (d) Using your graph, explain which equipment should be bought, giving your reasoning.
(2)

The manager of the company does not understand why the balloons, toys and whistles have not been considered in the above calculations. (e) Explain briefly why they do not need to be considered.
(2) (Total 18 marks)

Churston Ferrers Grammar School

D1 Linear Programming Assessment C

3.

A company produces two types of self-assembly wooden bedroom suites, the Oxford and the York. After the pieces of wood have been cut and finished, all the materials have to be packaged. The table below shows the time, in hours, needed to complete each stage of the process and the profit made, in pounds, on each type of suite. Oxford York Cutting Finishing Packaging Profit () 4 3.5 2 300 6 4 4 500

The times available each week for cutting, finishing and packaging are 66, 56 and 40 hours respectively. The company wishes to maximise its profit. Let x be the number of Oxford, and y be the number of York suites made each week. (a) (b) Write down the objective function.
(1)

In addition to 2x + 3y < 33, x > 0, y > 0, find two further inequalities to model the companys situation.
(2)

(c)

On a piece of graph paper, illustrate all the inequalities, indicating clearly the feasible region.
(4)

(d) (e)

Explain how you would locate the optimal point.


(2)

Determine the number of Oxford and York suites that should be made each week and the maximum profit gained.
(3)

It is noticed that when the optimal solution is adopted, the time needed for one of the three stages of the process is less than that available. (f) Identify this stage and state by how many hours the time may be reduced.
(3) (Total 15 marks)
Churston Ferrers Grammar School 3

D1 Linear Programming Assessment A


1. (a) Maximise P = 30x + 40y (or P = 0.3x + 0.4y) subject to x + y > 200 x + y > 500 20 x > 100 (x + y) -> 4x > y M1 A1 40 100 x> (x + y) -> 3x > 2y 6 (b) B1 B1 B1

A1

B5,4,3,2,1,0 (x + y = 200, x + y = 500) B1 ft (y = 4x) B1 ft (2y = 3x) B1 ft (labels) B1 ft FR B1 (NB: Graph looks OK onscreen at 75% magnification but may print out misaligned) (c) Point testing or profit line M1 Intersection of y = 4x and x + y = 500 (100, 400) Profit = 190 (units must be clear)
Churston Ferrers Grammar School

A1 A1
4

3
[14]

D1 Linear Programming Assessment B


2. (a) Maximise, (P =) 15x + 15y Subject to 3x + 10y < 3000 3x + 2y < 1200 x > 2y x, y > 0 (b) 600 B1, B1 B3, 2, 1, 0 B3, 2, 1, 0 5

y 3x + 2y = 1200

500 x = 2y 400

300

200

P ro fit lin e

100 F e a s ib le R e g io n 0 200 400 600 800 3x + 10y = 3000 x 1000 B6, 5, 4, 3, 2, 1, 0 M1 A1ft A1ft

6 3

(c) (d)

Profit line or vertex testing, (300, 150). Profit = 67.50

Production of stickers should be increased since this would be more the intersection point further from the origin. B2, 1ft, 0 e.g. The constraint line, would be for outside the feasible regionB2, 1, 0 so they would not effect it.

2 2
[18]

(e)

Churston Ferrers Grammar School

D1 Linear Programming Assessment C


3. (a) (b) (P =) 300x + 500y Finishing 3.5x + 4y < 56 -> 7x + 8y < 112 (or equivalent) Packing 2x + 4y < 40 -> x + 2y < 20 (or equivalent) B1 B1 B1 3

y 14

12 11 10

3 .5 x + 4 y = 5 6

2x + 3y = 33

F. R .
x + 2y = 20
lin e Pr of it

12

(c)

16 1 6 .5

20

B4, 3, 2, 1, 0 4 (d) e.g.: Point testing: test corner points in feasible region find profit at each and select point yielding maximum Profit line: draw profit lines select point on profit line furthest from the origin 2 (e) Using a correct, complete method make 6 Oxford and 7 York Profit = 5300

B2,1,0 M1 A1 ft A1 ft 3
6

Churston Ferrers Grammar School

(f)

The line 3.5x + 4y = 49 passes through (6, 7) so reduce finishing by 7 hours

M1 A1 ft A1 3
[15]

Churston Ferrers Grammar School

You might also like