Scribd Logo
Upload

Welcome to Scribd!

  • 58 views

    Or Lecture 1 Linear Programming

    Uploaded by

    Shatterheart06 Wattpad
    The document discusses solving linear programming problems graphically and algebraically. It provides examples of maximizing and minimizing objective functions subject to various constraints. The examples find the optimal values of decision variables that maximize profit or minimize costs. The last problem formulates a linear program to determine the optimal mixture of ingredients to minimize cost.

    Copyright:

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

    Or Lecture 1 Linear Programming

    Uploaded by

    Shatterheart06 Wattpad
    58 views51 pages
    The document discusses solving linear programming problems graphically and algebraically. It provides examples of maximizing and minimizing objective functions subject to various constraints. The examples find the optimal values of decision variables that maximize profit or minimize costs. The last problem formulates a linear program to determine the optimal mixture of ingredients to minimize cost.

    Original Description:

    programming lecture

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses solving linear programming problems graphically and algebraically. It provides examples of maximizing and minimizing objective functions subject to various constraints. The examples find the optimal values of decision variables that maximize profit or minimize costs. The last problem formulates a linear program to determine the optimal mixture of ingredients to minimize cost.

    Copyright:

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

    Or Lecture 1 Linear Programming

    Uploaded by

    Shatterheart06 Wattpad
    The document discusses solving linear programming problems graphically and algebraically. It provides examples of maximizing and minimizing objective functions subject to various constraints. The examples find the optimal values of decision variables that maximize profit or minimize costs. The last problem formulates a linear program to determine the optimal mixture of ingredients to minimize cost.

    Copyright:

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

    LINEAR

    PROGRAMMING USING
    GRAPHICAL METHOD
    AND ALGEBRAIC
    METHOD
    LINEAR FUNCTION AND
    LINEAR INEQUALITY
    FEASIBLE REGION
    GRAPHICALLY SOLVING
    LINEAR PROGRAMMING
    PROBLEMS
    Problem 01
    Maximize z = 6x1 + 5x2
    Subjected to: x1 + x2 ≤ 5
    3x1 + 2x2 ≤ 12

    x1, x2 ≥ 0
    Answer 01:
    x1 = 2
    x2 = 3
    Z = 27
    Problem 02
    Minimize z = 6x1 + 3x2
    Subjected to: 2x1 + 4x2 ≥ 16
    4x1 + 3x2 ≥ 24

    x1, x2 ≥ 0
    Answer 02:
    x1 = 0
    x2 = 8
    Z = 24
    Problem 03
    A farmer has 240 acres to plant. He needs to
    decide how many acres of corn to plant and how
    many of oats. He can make P 40 per acre profit
    for corn and P 30 per acre for oats. However,
    the corn takes 2 hours of labor per acre to
    harvest and the oats only take 1 hour per acre.
    He only has 320 hours of labor he can invest. To
    maximize his profit, how many acres of each
    should he plant?
    Answer 03:
    x1 = 80 acres of corn
    x2 = 160 acres of oats
    Z = P 8 000
    Problem 04
    The ABC Furniture produces tables. The
    fixed monthly cost for production is P
    320000 and the variable cost per table is P
    2 600. The table is sold for P 7 200 a piece.
    A) For a monthly volume of 300 tables,
    determine the total cost, total revenue, and
    total profit. B) Determine the monthly break-
    even volume for the ABC Furniture.
    Answer 04:
    A)
    Total Cost (TC) = P 1 100 000
    Total Revenue (TR) = P 2 160 000
    Total Profit (TP) = P 1 060 000

    B) Volume = 70 tables
    Problem 05
    XYZ Meat Company produces hotdog mixtures in at most
    1 000 lbs per batch. The mixture contains two ingredients –
    chicken and beef. The cost per pound of each of these
    ingredients is as follows: chicken is P 3 / lb and beef is P 5
    / lb. Each batch has the following recipe requirements: at
    least 500 lbs of chicken and at least 200 lbs of beef. The
    ratio of chicken to beef must be at least 2 to 1. The
    company wants to know the optimal mixture of ingredients
    that will minimize cost. Formulate a linear programming for
    this problem.
    Answer 05:

    Mixture must contain 800 lbs of


    chicken and 200 lbs of beef. It has
    a total cost of P 3 400.
    Problem 06
    Reddy Mikks produces both interior and exterior paints from the
    two raw materials, M1 and M2. The following table provides the
    basic data of the problem:
    Tons of Raw materials per ton of Maximum daily
    Exterior paint Interior paint availability (tons)

    Raw Material, M1 6 4 24
    Raw Material, M2 1 2 6
    Profit per ton (P 1000) 5 4

    A market survey indicates that the daily demand for interior paint
    cannot exceed that for exterior paint by more than 1 ton. Also the
    maximum daily demand for interior paint is 2 tons. Reddy Mikks
    wants to determine the optimum (best) product mix of interior and
    exterior paint that maximizes the total daily profit.
    Answer 06:

    x1 = 3 tons
    x2 = 1.5 tons
    Z = 21 (P 21 000)

    You might also like