simplex method

Post on 26-Nov-2015

6 Views

Category:

Documents

2 Downloads

Preview:

Click to see full reader

DESCRIPTION

Linear Programming problem

TRANSCRIPT

  • ; Choeter ''f . L ?f * slMpLEX r4ETHoDA firm rnanufactures two products A & B on which tbe p"rofi* earned per unit are Rs. 3 and

    Ash Profits in,,(%r) rapees per ton2.0 t 2.003.0 t 5.005.0 t 4.00

    Rs. 4 respectively. Each product is pracessed.on two. mac.Ejltei"M1 and M2. Product A requiresone minute of processing time on M 1 and two minutes o.n M2, while B requires one minute on M 1and one minute on M2. Machine M 1 $ avai!_able f9r ,01

    -o!g than 7 hrs. 30 m\s. while machineM 2 is available for I 0 hrs. during any working day Find the number of units df products A andB to be manufactured to get maximu.m-p761iy. ' ..'; ;.' ''' '

    t,l:l sri i#ltip.tefi itub, th Ad Ay'sdh e' 7ft;6; foltowirt !, pro bl em :1-. ; |,i ni4'i,MwtW.gi $ *.Zxi +..,'5X,$, ''j,;, :' . i '. ..}.'i,su6ieetb'"J6it,+"4h.&)l,.i..;..J.'."

    .'r ,: J"{i;i ,:l :,: ii, : l; :r4;r,.' $fi7.l +'ggp.rgi',?l;

    Xt, x2 2 A. i

    maximizeZ = 4x1 *3x2*6yr,subject to 2x1 * 3x2 * 2xs < 440,

    4xt +3xr

top related