Scribd Logo
Upload

Welcome to Scribd!

  • محاضرة 10

    Uploaded by

    fsherif423
    7 views22 pages
    The document discusses linear programming and maximization problems. It covers converting inequalities in constraints to equations, finding the feasible solution region, and important notes about the feasible solution region for any constraint in linear programming problems. The optimal solution is obtained by maximizing the objective function subject to the constraints.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses linear programming and maximization problems. It covers converting inequalities in constraints to equations, finding the feasible solution region, and important notes about the feasible solution region for any constraint in linear programming problems. The optimal solution is obtained by maximizing the objective function subject to the constraints.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views22 pages

    محاضرة 10

    Uploaded by

    fsherif423
    The document discusses linear programming and maximization problems. It covers converting inequalities in constraints to equations, finding the feasible solution region, and important notes about the feasible solution region for any constraint in linear programming problems. The optimal solution is obtained by maximizing the objective function subject to the constraints.

    Copyright:

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

    2023 /2024

    Fall Semester

    Quantitative Methods for Business

    Dr . Nawal Ahmed Abo Zeid


    Lecture(10) “linear programming continue”
    “

    Page 1 2
    Linear programming
    2-

    3
    4
    Case of maximization

    5
    Solution
    1. Convert the inequalities (≤ or ≥) in all constrains into equations form:

    2X + 4Y = 80 3X + Y = 60

    6
    7
    8
    Imp. Notes: The feasible solution region for any constraint

    9
    10
    11
    14
    15
    16
    18
    19
    20
    21

    You might also like