Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
11 views

Slides 2 - Linear Programming - Graphical Method

This document introduces linear programming and provides an example problem to demonstrate the graphical solution procedure for linear programming problems with two decision variables. The example problem involves maximizing profit from producing two products subject to production capacity constraints at three plants. The document outlines the steps of the graphical solution procedure which involves graphing the feasible region defined by the constraints and finding the optimal solution on the objective function line with the largest value within the feasible region.

Uploaded by

INU-51-Nihar Nimsarkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Slides 2 - Linear Programming - Graphical Method

This document introduces linear programming and provides an example problem to demonstrate the graphical solution procedure for linear programming problems with two decision variables. The example problem involves maximizing profit from producing two products subject to production capacity constraints at three plants. The document outlines the steps of the graphical solution procedure which involves graphing the feasible region defined by the constraints and finding the optimal solution on the objective function line with the largest value within the feasible region.

Uploaded by

INU-51-Nihar Nimsarkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Introduction to Linear

Programming
Linear Programming
• Problem Solving approach developed to help managers make
decisions.
• Properties of Linear Programming:
• Objective is maximization or minimization of objective
• Restrictions / constraints that limit the degree to which the objective can be
pursued.
Graphical Solution Procedure
• Used for a linear programming problem involving only two decision
variables
• Example: Use graphical procedure to solve the following problem:
Maximize Z = 2X1 + 2X2
subject to
X2 ≤ 8
2X1 + 5X2 ≤ 60
X1 + X2 ≤ 20
and
X1 ≥ 0, X2 ≥ 0
Summary of the Graphical Solution
Procedure
• Steps of the graphical solution procedure for maximization problem:
1. Prepare a graph of the feasible solutions for each of the constraints
2. Determine the feasible region by identifying the solutions that satisfy all the
constraints simultaneously
3. Draw an objective function line
4. Move parallel objective function line toward larger objective value until
further improvement is infeasible
5. Any feasible solution on the objective function line with the largest value is
an optimal solution
Example
• The Wyndor Glass Co. produces high-quality glass products, including windows
and glass doors. It has three plants. Aluminum frames and hardwood are made in
Plant 1, wood frames are made in Plant 2, and Plant 3 produces the glass and
assembles the products. Because of the declining earnings, top management has
decided to revamp the company’s product line. Unprofitable products are being
discontinued, releasing product capacity to launch two new products having large
scale potential.
• Product 1 : A glass door with aluminum framing
• Product 2: A double hung wood framed window.
Example
Product 1 requires production capacity from Plant 1 and Plant 3, and Product 2
requires production capacity from Plant 2 and Plant 3. The marketing department
has concluded that the WGC can sell as much as is produced of the two products
(they expect the products to be popular among the customers). However, Product 1
and 2 are competing for the same production capacity at Plant 3, so the WGC is not
sure about how to mix the two products.
Example
• The data for the problem is given below:
Plant Production time per batch Production
(Hours) time available
Product per week ,
Hours
1 2
1 1 0 4
2 0 2 12
3 3 2 18
Profit per batch $3000 $5000

• Formulate the linear programming model for the problem and solve using
graphical method.

You might also like