Scribd Logo
Upload

Welcome to Scribd!

  • LPP (Day-9)

    Uploaded by

    Faizan Ansari
    6 views2 pages
    1. The document summarizes a mathematics class on linear programming problems (LPP). It includes the class topic, date, and 10 practice problems on solving LPPs graphically. 2. The class covered linear programming problems, corner points of feasible regions, and solving LPPs to maximize or minimize objective functions subject to various constraints graphically. 3. Ten homework problems were assigned involving determining corner points, minimum/maximum values of objective functions, and solving LPPs graphically given objective functions and constraint equations.

    Original Description:

    Original Title

    LPP (DAY-9 )

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document summarizes a mathematics class on linear programming problems (LPP). It includes the class topic, date, and 10 practice problems on solving LPPs graphically. 2. The class covered linear programming problems, corner points of feasible regions, and solving LPPs to maximize or minimize objective functions subject to various constraints graphically. 3. Ten homework problems were assigned involving determining corner points, minimum/maximum values of objective functions, and solving LPPs graphically given objective functions and constraint equations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    LPP (Day-9)

    Uploaded by

    Faizan Ansari
    1. The document summarizes a mathematics class on linear programming problems (LPP). It includes the class topic, date, and 10 practice problems on solving LPPs graphically. 2. The class covered linear programming problems, corner points of feasible regions, and solving LPPs to maximize or minimize objective functions subject to various constraints graphically. 3. Ten homework problems were assigned involving determining corner points, minimum/maximum values of objective functions, and solving LPPs graphically given objective functions and constraint equations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    KV HINOO FIRST SHIFT

    WINTER CAMP CLASSES


    CLASS XII SUBJECT- MATHEMATICS
    DAY- 9 (11.01.2024)
    Linear Programming Problem
    Class Work
    1. The max value of Z = 4x +3y, if the feasible region for an LPP is as shown below, is

    (a)122 (b) 100 (c) 72 (d) 112

    2. Corner points of the feasible region determined by the system of linear constraints are
    (0 , 3)(1 ,1) and (3 , 0). Let Z= px+ qy where p , q>0 . Condition on p and q so that the min of
    Z occurs at (3,0) and (1,1) is
    (a) p = 3q (b) p = q/2 (c) p = 2q (d) p = q
    3. Solve the following LPP graphically
    Maximize Z=4 x + y subject to the constraints x + y ≤ 50 , 3 x+ y ≤ 90 , x ≥ 0 , y ≥ 0
    4. Solve the linear programming problem graphically
    Maximize Z = 4x + 3y subject to x + y ≤ 5 , x ≤ 2 , x , y ≥ 0

    Homework
    5. The corner points of the shaded unbounded feasible region of an LPP are (4,18), (6,12), (15,0)
    and (40,0) as shown in the figure. The minimum value of the objective function Z = 20x+10y is
    at point

    (a) (15,0) (b) (40,0) (c) (4,18) (d) (6,12)


    6. The corner points of the feasible region determined by the following system of linear
    inequalities: 2 x+ y ≤ 10 , x +3 y ≤15 , x , y ≥ 0 are (0 , 0),(5 , 0),(3 , 4),(0 , 5) . Let Z= px+ qy ,
    where p , q>0 . Condition on p and q so that the maximum of Z occurs at both (3,4) and (0,5) is
    ^
    (a) p = q (b) p = 2q (c) p = 3q (d) q=3 p
    7. The feasible for a LPP is shown in the given figure. Let Z=3 x−4 y be the objective function,
    minimum of Z occurs at
    (a) (0,0) (b) (0,8) (c) (5,10) (d) (4,10)

    8. Solve the following problem graphically:

    Maximize Z = 3x+9y subject to x+3y ≤ 60 , x + y ≥ 10 , x ≤ y , x ≥ 0 , y ≥ 0

    9. Solve the following Linear Programming Problem by graphical method:

    Minimize Z=20 x+10 y subjected to x +2 y ≤ 40 ; 3 x+ y ≥ 30 ; 4 x +3 y ≥ 60; x , y ≥ 0

    10. Solve the following linear programming problem graphically:


    Minimize Z=200 x+500 y subject to the constraints x +2 y ≥ 10 ; 3 x + 4 y ≤24 ; x ≥ 0 , y ≥ 0
    11. Minimize Z = 3x + 5y
    Subject to the constraints
    x +2 y ≤ 2000 , x + y ≤ 1500 , y ≤ 600 , x ≥ 0 , y ≥ 0

    You might also like