Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Handouts LPP Graphical Methods

    Uploaded by

    anasibnomar

    Copyright:

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

    Handouts LPP Graphical Methods

    Uploaded by

    anasibnomar
    2 views16 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
    2 views16 pages

    Handouts LPP Graphical Methods

    Uploaded by

    anasibnomar

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 16

    What is Linear Programming?

    What are the essential requirements, advantages and


    limitations of a Linear Programming Problem (LPP)?

    Linear Programming is a technique of selecting the best possible (optimal) strategy among a
    number of alternatives. It is an extremely useful technique used for the purpose of maximizing
    some objective such as profit or minimizing some objective such as costs in order to achieve the
    objectives of the organization.

    An objective function is some sort of mathematical relationship between the variables under
    consideration. In the case of linear programming this relationship is always taken as linear.
    An objective function can be of the form
    Z=A1x1+ A2x2 + … … + Anxn, where A1, A2, … … , An are certain constant.

    The problem of linear programming is to find out some suitable combination of x1, x2, … … , xn
    etc. which optimizes (i.e. maximizes or minimizes) the objective function. The objective function
    is to be optimized under certain restrictions imposed on the variables occurring in the objective
    function. These restrictions must be known and should be expressed in algebraic expressions.

    The following requirements are involved in a LPP:

    (i) There must be a well-defined objective function (profit, cost, quantities


    produced) which is to be either maximized or minimized and which can be
    expressed as a linear function of decision variables.
    (ii) There must be restrictions on the amount or extent of attainment of the objective
    and these restrictions must be capable of being expressed as a linear equalities
    or inequalities in terms of variables.
    (iii) Another necessary requirement is that decision variables should be inter-related
    and non-negative. The non-negativity condition shows that linear programming
    deals with real life situation for which negative quantities are generally illogical.

    Advantages: The main advantages of Linear Programming are:

    (i) It helps in attending the optimum use of productive factors. For example: more
    efficient use of manpower and machines can be obtained by the use of LPP.
    (ii) It improves the quality at decisions.
    (iii) It can go a long way in improving the knowledge and skill of tomorrow’s
    executives.
    (iv) It gives possible and practical solution of other constraints operation outside the
    LPP.
    (v) It highlights the bottlenecks in the production process.

    Limitations: Though having a wide field of applications, Linear Programming has the following
    limitations:

    1|Page
    (i) For large problem having many limitations and constraints the computational
    difficulties are enormous.
    (ii) According to the LPP, the solution variable can have any value, integers or
    fractions; whereas sometimes it happens that some of the variables can have
    only integer value.
    (iii) The model does not take into account the effect of time and uncertainty.
    (iv) Many times, it is not possible to express both the objective function and
    constraints in linear form.
    (v) When a problem consists of inflicting multiple objectives, this techniques cann’t
    provides a solution.

    General form of a Linear Programming Problem (LPP):


    Mathematically a general Linear Programming Problem (LPP) can be stated as follows:
    Optimize z = c 1 x 1 + c 2 x 2 + ... ... + c n x n
    Subject to the constraints
    a 11 x 1 + a1 2 x 2 + ... ... + a1 n x n ( / = /  )b 1
    a 21 x 1 + a 2 2 x 2 + ... ... + a 2 n x n ( / = /  )b 2
    … … … … … … … … … …
    a m1 x 1 + a m 2 x 2 + ... ... + a m n x n ( / = /  )b m
    and the non negativity restrictions x j  0; j = 1, 2,, n .

    Or in matrix form
    Optimize z = c x t
    Subject to the constraints
    A x ( / = / ) b
    and the non negativity restrictions x  0 .

    Example-1:
    Maximize z = 3 x1 + 2 x 2 + 5 x3
    Subject to 2 x1 − 3x2  3
    x1 + 2 x2 + 3 x3  5
    3 x1 + 2 x3  2
    and x 1  0 , x 2  0.

    2|Page
    Example-2:
    Min. Z=3x1+5x2
    Subject to x1+ x2 =200
    x1≤80
    x2≥60
    x1, x2≥0

    3|Page
    4|Page
    5|Page
    6|Page
    7|Page
    8|Page
    9|Page
    10 | P a g e
    11 | P a g e
    12 | P a g e
    13 | P a g e
    14 | P a g e
    The Navana furniture company makes two kinds of bookcases A and B. Type A requires 2
    hours on machine 1 and 4 hours on machine 2, Type B requires 3 hours on machine 1 and 2
    hours on machine 2. The machines work no more than 16 hours per day. The profit is Tk. 50
    per bookcase A and Tk. 30 per bookcase B. Formulate the Linear programming problem,
    then solve it graphically.

    Hints: Let x 1 and x 2 represents the number of bookcase of type A, B respectively, and Z
    represents the contribution to fixed expenses and profit.

    The linear programming problem is


    Maximize z = 50 x1 + 30x 2
    Subject to 2 x1 + 3x 2  16
    4x1 + 2 x 2 16
    and x 1  0 , x 2  0.

    Production must be scheduled for two types of machines, machine 1 and machine 2. 120
    hours and 80 hours of time can be scheduled for machine 1 and machine 2 respectively.
    Production during the scheduling period is limited to two products, A and B. Each unit of
    product A requires 2 hours of process time on each machine. Each unit of product B requires
    3 hours on machine 1 and 1.5 hours on machine 2. The contribution margin is $4.00 per unit
    of product A and $ 5.00 per unit of product B. Both types of products can be readily
    marketed; consequently, production should be scheduled with the objective of maximizing
    profit. Formulate the linear programming problem and hence solve the problem by using
    graphical method.
    Hints:
    Let x1 and x2 represents the number of units scheduled for production of product A and B
    respectively; P represents Contribution for fixed expenses and profit.

    Then the Linear Programming Problem is


    Max.: P = 4 x1 + 5 x2
    Subject to 2 x1 + 3x2 120
    2 x1 + 1.5 x2  80
    and x j  0; j = 1, 2.

    15 | P a g e
    A company combines factor A and factor B to form a product which must weight 50 kg. At
    least 20 kg of A and no more than 40 kg of B can be used. The cost of A is Tk. 10 per kg and
    that of B Tk. 25 per kg. Formulate the problem as a linear programming problem (LPP),
    hence solve the problem to find out quantity of A and B which should be cost effective by
    using graphical method.

    An animal feed company must produce 200 kg of a mixture consisting of ingredients x 1 and
    x2. The ingredient x1 costs Tk. 3 per kg and x2 costs Tk. 5 per kg. No more than 80 kg of x1
    can be used and at least 60 kg of x2 must be used. Formulate and solve the model to minimize
    the cost of the mixture.

    Hints:
    Min. Z=3x1+5x2
    Subject to x1+ x2 =200
    x1≤80
    x2≥60
    x1, x2≥0

    16 | P a g e

    You might also like