Linear Programming Questions
Folien in diesem Satz (6)
-
- Some farmer buys x goats , y pigs and z sheep.
- He must buy at least 110 animals
- He must buy at least as many pigs as goats
- The number of pigs and sheep he must buy must not together exceed 150
- Each goat costs £16 , each pig costs £8 and each sheep costs £24
- He has £3120 to spend
- Later, he will sell them all to make £70 profit on each goat, £30 profit on each pig and £50 profit on each sheep. He wishes to maximize his total profit, £P.
- Formulate this situation as a linear programming problem.
-
- 110 animals : x+y+z=110
- As many pigs as goats: y≥x
- Pigs and sheep no grater than 150: y+z≤150
- Goats £16 , pigs £8, sheep £24, total no more than £3120: 16x+8y+24z ≤ 3120
- x≥0 , y≥0 , z≥0 as no negatives
- Maximize £P: 70x + 30y + 50z
-
- A factory makes 3 different novelty boxes: red, blue and green. Each box contains 3 types of toy: A,B,C.
- Each red box has 2 type A toys, 3 type B toys and 4 type C toys
- Each blue box has 3 type A toys, 1 type B toy and 3 type C toys
- Each green box has 4 type A toys, 5 type B toys and 2 type C toys
- Each day, the maximum number of toys available to be packed is 360 type A , 300 type B and 400 type C.
- Each day, the factory must pack more type A toys than type B toys
- Each day, the total number of type A and type B toys that are packed must be at least as many as the number of type C toys packed
- Each day, at least 40% of the total toys that are packed must be type C toys
- Each day, the factory packs x red boxes, y blue boxes and z green boxes.
- Formulate this situation as 6 inequalities, in addition to x≥0 , y≥0 and z≥0
-
- Do 2 way table as on left to get: 2x+3y+4z≤360 , 3x+y+5z≤300 and 4x+3y+2z≤400 (uses data from first 5 lines)
- More A than B: 2x+3y+4z > 3x+y+5z , same as -x+2y-z>0
- As many A and B as C: A+B = 5x+4y+9z ≥ 4x+3y+2z, same as x+y+7z ≥ 0
- At least 40% must be C: A+B+C = 9x+7y+11z, so 0.4(9x+7y+11z) ≤ 4x+3y+2z
-
- A teacher is planning a trip for 174 pupils and 18 staff, where they will travel on minibuses and coaches.
- Each minibus costs £40 and can take up to 16 people, including at least 2 staff.
- Each coach costs £160 and can take up to 48 people, including at least 3 staff.
- There must be enough staff on each vehicle
- x= number of minibuses, y=number of coaches.
- What is the cheapest way of arranging the transport?
- (Formulate and solve)
-
- x≥0 , y≥0 (as no negatives)
- 16x + 48y ≥ 192 (as 16 on mini and 48 on coach with 192 tot.)
- 2x + 3y ≤ 18 (as 2 staff on mini and 3 on coach out of 18 tot.)
- Minimize C = 40x + 160y (as £40 mini and £160 coach)
- As we found x=6 and y=2, we sub this into Minimize C = 40x + 160y , so 40(6) + 160(2) = £560
- Conclude: They should take 6 minibuses and 2 coaches, with the minimum cost of £560.
Informationen
- Beschreibung
- Linear Programming Questions
- Erstellt von
- Doc Boff · Dez 2018
- Aktualisiert
- 10 Dez 2018
- Aufrufe
- 10
- Bewertung