Scribd Logo
Upload

Welcome to Scribd!

  • 196 views

    Lecture 3 - Linear Programming

    Uploaded by

    Sakshi Khatri
    This document discusses special cases that can occur in linear programming problems: - No feasible solutions if satisfying one constraint violates another - Unbounded problems if objective function can increase without limit - Redundant constraints that do not alter the feasible solution space - Multiple optimal solutions where different variable combinations yield the same optimal value

    Copyright:

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

    Lecture 3 - Linear Programming

    Uploaded by

    Sakshi Khatri
    196 views14 pages
    This document discusses special cases that can occur in linear programming problems: - No feasible solutions if satisfying one constraint violates another - Unbounded problems if objective function can increase without limit - Redundant constraints that do not alter the feasible solution space - Multiple optimal solutions where different variable combinations yield the same optimal value

    Original Description:

    OR

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses special cases that can occur in linear programming problems: - No feasible solutions if satisfying one constraint violates another - Unbounded problems if objective function can increase without limit - Redundant constraints that do not alter the feasible solution space - Multiple optimal solutions where different variable combinations yield the same optimal value

    Copyright:

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

    Lecture 3 - Linear Programming

    Uploaded by

    Sakshi Khatri
    This document discusses special cases that can occur in linear programming problems: - No feasible solutions if satisfying one constraint violates another - Unbounded problems if objective function can increase without limit - Redundant constraints that do not alter the feasible solution space - Multiple optimal solutions where different variable combinations yield the same optimal value

    Copyright:

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

    LINEAR PROGRAMMING –

    CONTINUED
    Special Cases
    ■ No Feasible Solutions
    – Occurs in problems where to satisfy one of the constraints, another constraint must be
    violated.

    ■ Unbounded Problems
    – Exists when the value of the objective function can be increased without limit.

    ■ Redundant Constraints
    – A constraint that does not form a unique boundary of the feasible solution space; its removal
    would not alter the feasible solution space.

    ■ Multiple Optimal Solutions


    – Problems in which different combinations of values of the decision variables yield the same
    optimal value.
    Infeasible Solution
    Unbounded Solution
    Redundant Constraint
    Multiple Solution or Alternative Optima
    Question 14, Page 145

    A manager of an automobile dealership must decide how many cars to order for the end
    of the model year. Midsize cars yield an average profit of $500 each, and compact cars
    yield an average of $400 each. Either type of car will cost the dealership $8,000 each
    and no more than $720,000 can be invested. The manager wants at least 10 of each
    type of car but no more than 50 of the midsized cars and no more than 60 of the
    compact cars.
    (a) Formulate the linear programming model of this problem.
    (b) Solve for the optimal quantities of each type of car and the optimal value of the
    objective function.
    Question No. 25, Page 147
    The manager of an inspection department has been asked to help reduce a backlog of safety devices that must be
    inspected. There are two types of safety devices: one for construction workers and one for window washers. The
    manager will be permitted to select any combination of items because new testing equipment will soon be available
    that will handle the remaining items. However, in the short run, the manager has been asked to help generate revenue.
    The revenue for each construction device is $60, and the revenue for each window washing device is $40. The
    manager has obtained data on the necessary inspection operations, which are

    Time per Unit (Minutes)


    Operation Construction Window Washing Total Time Available (Minutes)
    Test #1 ¼ 1/3 75
    Test #2 ¼ ½ 50
    Test #3 ½ ¼ 40

    (a) Formulate this problem as a linear programming model.


    (b) Determine the optimum values of the decision variables and the revenue that will result.
    (c) Which testing operation will have slack time? How much?
    (d) Is any constraint redundant? Which one? Why?
    Graph

    3𝑥1 + 4𝑥2 ≤900

    𝑥2 2𝑥1 + 𝑥2 ≤160

    𝑥1 + 2𝑥2 ≤ 200

    𝑥1
    Graph

    𝑥2

    60𝑥1 +40 𝑥2 =2400

    𝑥1
    Graph

    𝑥2

    𝑥1 = 40; 𝑥2 = 80; 𝑍 = 5,600

    𝑥1
    Q. No. 28, Page 148
    A production manager is faced with the question of how to allocate the manufacturing
    of a microwave oven between his own company and a subcontractor because neither
    firm can handle the demand alone. Fabrication costs are $10 per unit within the
    company and $20 per unit from the subcontractor; assembly costs are $8 per unit
    within the company and $1 per unit from the subcontractor. The company has a budget
    of $120,000 for fabrication, and $40,000 for assembly, and $12,000 for inspection.
    The contribution to profits is $60 per unit regardless of which firm does the work.

    (a) Formulate this problem as a linear programming model.


    (b) What is the optimal solution? How much profit will it yield?
    (c) How much of the total budget will be unused by the optimal solution?
    Decision Variable
    𝑥1 = Allocation of manufacturing quantity to his own company
    𝑥2 = Allocation of manufacturing quantity to subcontractor

    Objective Function
    Maximize, 𝑍 = 𝑥1 + 𝑥2

    Subject to constraints,
    Fabrication: 10𝑥1 + 20𝑥2 ≤ 120,000
    Assembly: 8𝑥1 + 5𝑥2 ≤ 40,000
    Inspection: 3𝑥1 + 1𝑥2 ≤ 12,000

    𝑥1 , 𝑥2 ≥ 0

    You might also like