Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    Adobe Scan 13 Oct 2024

    Uploaded by

    ratikam30

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Adobe Scan 13 Oct 2024

    Uploaded by

    ratikam30
    1 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    1 views4 pages

    Adobe Scan 13 Oct 2024

    Uploaded by

    ratikam30

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    '-- WHS■ITAOI:

    .__,__
    XP.HlltNTfM,

    .........
    ~J~tKlfll

    M&CCT-~~Ck l
    ::::...,-=:..:::; SlUIOlt-ZOU.U ...__ _
    L "'---'_,._...,,...: -•Nf
    1
    ). ~

    •· s.ri ...
    ..... ,....,._,.,.,...,-.._,._
    1«1-ANlll~-1•---"""""--~I-•«"

    c,_..,......__,....,..1~_..
    I, s«tiO<ID11t,1wn1- ~5..,.... e-.
    l. 5"KlloflfM1J1-i11...,W.S ,..ff..,.;t,of--l•~-"-I" """..,._....,,

    ......

    ~ - A c....i1119'MI el1....,t-h.
    ...,.,..
    QUl'fflONS --

    QI '"""'-119J~C_.,_ ..,.,....,,P-".....,tl ,v'fKtle..._,.(I/~


    ,.........,.,.w~
    '

    ••J••lf&5,a•y&4 (lb)••lv1tS,o•y.$4
    fd••lv1tS:••Y1t, (IIJ••ly&,:o•ylt4

    Ql A1t;M<-.ttdQW!"ltffy,l ll<tp,1-W'f'C¥.iueo/1~ .,;tyql «00_.,.Ml9~


    ll'llttnclf/lUCll~f'flJ:
    1J )0000 O)MIOOO cl<IOOOO di 10000

    QJ
    ,,._,__,,_ ..
    M,.-...,.__..,.._,A"2 ,00.000•111110'i-'.. .,__..,_bS)--t.\ll_..,

    •I 6000 1)1000 rJ«IXI '1S000

    ,.1ol7
    8 The feasible region of a linear programming problem 1s shown in the figure below:

    Which of lhe following are lhe possible constraims?


    (a) X + 2y l:: 4, X + y S 3. X 2: 0, y l:: 0
    (b) X + 2y S 4, X + y S 3. X 2: 0, y 2: 0
    (C) X + 2y 2: 4, X + y 2: 3. X 2: 0, y 2: 0
    (d) X + 2y 2: 4. X + y S 3, X S 0. y S 0
    FIVE MARKS QUESTIONS
    O 1 Solve the following LPP graph,caly
    Maxsmae 1 = 3x + y subJeCI to the constra.,ts

    x..-2y2100

    2x-ys0

    2x-y s 200

    x.y~O
    0 2 The comer points cA the feasible rag,or, clelermined by the system of linear
    constraints are as shown below

    8(4.10)

    g
    A(0,8)8 C(6,8)
    7
    6
    5
    4
    3
    2

    123456

    [CIISS xn : M11111) 221

    Answer each of the followlng .


    (i) Let z - 3x -4y be the objective lunebon Find the maximum and mn,mum
    value of z and also the correspondng points at wh,c h the maximum and
    mm,mum value occurs
    (ii) Let z = px • qy where p,q > 0 be the obJect,ve function Find the condibon
    on p and q so that the maximum value of z c,ccurs at B (4, 10) and C (5. 8)
    Also menbon the number of oplfflal solubons n this case
    Q.2 Two tailors A and B earn Rs 150 and Rs 200 per day respectively. A can sticth 6
    shirts and 4 pants per day, while B can strtch 10 shirts and 4 pants per day 11 is
    desired to produce atleast 60 shirts and 32 pants at a minimum labour cost

    Tailor A Tailors
    Based on the above information answer the following
    (1) If x and y are the number of days A and B won< respectively then find the
    ob)&Ctive function for lhls LPP
    (2) Find the optimal solution for this LPP and the minimum labour cost?

    You might also like