Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    0
    ReputationRep:
    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.

    Formulate the above situation as 6 inequalities, in addition to x≧0, y≧0, z≧0, simplifying your answers.



    Thank you anyone who answers
 
 
 
Poll
Do you agree with the PM's proposal to cut tuition fees for some courses?

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

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.