Scribd Logo
Upload

Welcome to Scribd!

  • 119 views

    CH 02

    Uploaded by

    GK Maylomin
    This document provides an overview of linear programming problems (LPP), including definitions, general forms, assumptions, and examples. It defines LPP as optimizing a linear objective function subject to linear constraints. The general form presented identifies decision variables, parameters, the objective function, and constraints. Key assumptions of LPP include proportionality, additivity, divisibility, determinism, finiteness, and optimality. Three examples of formulating LPPs are provided relating to manufacturing different products, allocating raw materials and labor, and determining mill operation days.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd

    CH 02

    Uploaded by

    GK Maylomin
    119 views8 pages
    This document provides an overview of linear programming problems (LPP), including definitions, general forms, assumptions, and examples. It defines LPP as optimizing a linear objective function subject to linear constraints. The general form presented identifies decision variables, parameters, the objective function, and constraints. Key assumptions of LPP include proportionality, additivity, divisibility, determinism, finiteness, and optimality. Three examples of formulating LPPs are provided relating to manufacturing different products, allocating raw materials and labor, and determining mill operation days.

    Original Title

    ch02

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of linear programming problems (LPP), including definitions, general forms, assumptions, and examples. It defines LPP as optimizing a linear objective function subject to linear constraints. The general form presented identifies decision variables, parameters, the objective function, and constraints. Key assumptions of LPP include proportionality, additivity, divisibility, determinism, finiteness, and optimality. Three examples of formulating LPPs are provided relating to manufacturing different products, allocating raw materials and labor, and determining mill operation days.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    119 views8 pages

    CH 02

    Uploaded by

    GK Maylomin
    This document provides an overview of linear programming problems (LPP), including definitions, general forms, assumptions, and examples. It defines LPP as optimizing a linear objective function subject to linear constraints. The general form presented identifies decision variables, parameters, the objective function, and constraints. Key assumptions of LPP include proportionality, additivity, divisibility, determinism, finiteness, and optimality. Three examples of formulating LPPs are provided relating to manufacturing different products, allocating raw materials and labor, and determining mill operation days.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 8

    Mekelle university College of Business and Economics Department of marketing

    Course Name: Operations research

    Instructor Name: Gebrekiros Hagos(MBA) Address : [email protected]

    Chapter two: linear programming


    Definition The general LPP calls for optimizing (maximizing / minimizing) a linear function of variables called the Objective function subject to a set of linear equations and / or inequalities called the Constraints or Restrictions.

    2.2 General form of LPP


    We formulate a mathematical model for general problem of allocating resources to activities. In particular, this model is to select the values for x1, x2 xn so as to maximize or minimize Z = c1x1 + c2x2 +.+cnxn subject to restrictions a11x1 + a12x2 + ..........+a1nxn ( or ) b1 a21x1 + a22x2 + ..+a2nxn ( or ) b2 am1x1 + am2x2 + .+amnxn ( or ) bm and x1 0, x2 0,, xn 0 Where Z = value of overall measure of performance xj = level of activity (for j = 1, 2, ..., n) cj = increase in Z that would result from each unit increase in level of activity j bi = amount of resource i that is available for allocation to activities (for i = 1,2, , m) aij = amount of resource i consumed by each unit of activity j

    Cont.....
    The level of activities x1, x2xn are called decision variables. The values of the cj, bi, aij (for i=1, 2 m and j=1, 2 n) are the input constants for the model. They are called as parameters of the model. The function being maximized or minimized Z = c1x1 + c2x2 +. +cnxn is called objective function. The restrictions are normally called as constraints. The constraint ai1x1 + ai2x2 ainxn are sometimes called as functional constraint (L.H.S constraint). xj 0 restrictions are called non-negativity constraint

    Assumptions in LPP
    Proportionality Additivity Divisibility Deterministic Finiteness Optimality

    Formulation of LP Problems
    Example 1: A firm manufactures two types of products A and B and sells them at a profit of Rs. 2 on type A and Rs. 3 on type B. Each product is processed on two machines G and H. Type A requires 1 minute of processing time on G and 2 minutes on H; type B requires 1 minute on G and 1 minute on H. The machine G is available for not more than 6 hours 40 minutes while machine H is available for 10 hours during any working day. Formulate the problem as a linear programming problem.

    Cont.....
    Example 2: A company produces two products A and B which possess raw materials 400 quintals and 450 labor hours. It is known that 1 unit of product A requires 5 quintals of raw materials and 10 man hours and yields a profit of Rs 45. Product B requires 20 quintals of raw materials, 15 man hours and yields a profit of Rs 80. Formulate the LPP.

    Cont....
    Example 3: A company owns 2 oil mills A and B which have different production capacities for low, high and medium grade oil. The company enters into a contract to supply oil to a firm every week with 12, 8, 24 barrels of each grade respectively. It costs the company Rs 1000 and Rs 800 per day to run the mills A and B. On a day A produces 6, 2, 4 barrels of each grade and B produces 2, 2, 12 barrels of each grade. Formulate an LPP to determine number of days per week each mill will be operated in order to meet the contract economically.

    You might also like