You are Here: Home >< Maths

# Decision 1 January 2013 watch

1. Hi,

Can someone help me with this linear programming question please?

A factory can make three different kinds of balloon pack: gold, silver and bronze.
Each pack contains three different types of balloon: type A, B & C.

• Each gold pack has 2 type A balloons, 3 type B balloons and 6 type C balloons.
• Each silver pack has 3 type A balloons, 4 type B balloons and 2 type C balloons.
• Each bronze pack has 5 type A balloons, 3 type B balloons and 2 type C balloons.

Every hour, the maximum number of each type of balloon available is 400 type A, 400 type B and 400 type C.

Every hour, the factory must pack at least 1000 balloons.

Every hour, the factory must pack more type A balloons than type B balloons.

Every hour, the factory must ensure that no more than 40% of the total balloons packed are type C balloons.

Every hour, the factory makes x gold, y silver and z bronze packs.

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: April 4, 2013
Today on TSR

### Tuition fees under review

Would you pay less for a humanities degree?

### Buying condoms for the first time - help!

Discussions on TSR

• Latest
Poll
Useful resources

Can you help? Study help unanswered threadsStudy Help rules and posting guidelinesLaTex guide for writing equations on TSR

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE