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

Graphical Method of Solving LPP

The document discusses using the graphical method to solve linear programming problems. It provides steps for using the graphical method, including identifying the problem, drawing the feasible region from the constraints, finding the optimal solution that maximizes the objective function, and interpreting the results. It then provides an example problem about maximizing profit from producing two TV models with constraints on labor hours and machine time.

Uploaded by

Hailemariam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views

Graphical Method of Solving LPP

The document discusses using the graphical method to solve linear programming problems. It provides steps for using the graphical method, including identifying the problem, drawing the feasible region from the constraints, finding the optimal solution that maximizes the objective function, and interpreting the results. It then provides an example problem about maximizing profit from producing two TV models with constraints on labor hours and machine time.

Uploaded by

Hailemariam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

Graphical Method of solving LPP

• To use the graphic method, the following steps are


needed:
1. Identify the problem – determine the decision
variables, the objective function, and the constraints.
2. Draw a graph including all the constraints and
identify the feasible region.
3. Obtain a point on the feasible region that optimizes
the objective function – optimal solution.
4. Interpret the results.
Note: Graphical LP is a two-dimensional model.
The Maximization Problem
• This is the case of Maximize Z with inequalities of constraints
in form.
• Consider two models of color TV sets; Model A and B, are
produced by a company to maximize profit. The profit realized
is $300 from A and $250 from set B. The limitations are
a) Availability of only 40 hrs of labor each day in the production
department,
b) A daily availability of only 45 hrs on machine time, and
c) Ability to sale 12 set of model A.
• How many sets of each model will be produced each day so
that the total profit will be as large as possible?
7. Interpret the result. Accordingly, the
highlighted result in the table above
implies that 12 units of Model A and
11 units of Model B TV sets should be
produced so that the total profit will
be $6350.
• Example 3.4 : A manufacturer of Light Weight mountain tents
makes two types of tents:
• REGULAR tent and SUPER tent.
• Each REGULAR tent requires one labor-hour from the cutting
department and 3 labor-hours from the assembly department.
• Each SUPER tent requires 2 labor-hours from the cutting
department and 4 labor-hours from the assembly department.
• The maximum labor hours available per week in the cutting
department and the assembly department are 32 and 84
respectively.
• Moreover, the distributor, because of demand, will not take
more than 12 SUPER tents per week.
• The manufacturer sales each REGULAR tents for $160 and
costs $110 per tent to make. Where as SUPER tent ales for
$210 per tent and costs $130 per tent to make.
Required
a) Formulate the mathematical model of the
problem
b) Using the graphic method, determine how many
of each tent the company should manufacture
each week so as to maximize its profit?
c) What is this maximum profit assuming that all
the tents manufactured in each week are sold in
that week
• The distributor will not take more than 12
SUPER tents per week. Thus, the
manufacturer should not produce more than
12 SUPER tents per week.
• Dear student, please formulate the
mathematical model based on the
information in the above table before going to
the solution part.
3. The Interpretation:
• The manufacturer should produce and sale 20
REGULAR tents and 6 SUPERS tents to get a
maximum weekly profit of $1480.
• Dear student, try to solve the above example by
adding 5 to each coefficient and 10 to the right
hand side values of the constraints.
The Minimization Problem
• In this case, we deal with Minimize Z with inequalities of
constraints in form
• Example 3.4 :Suppose that a machine shop has two
different types of machines; Machine 1 and Machine 2,
which can be used to make a single product.
• These machines vary in the amount of product produced
per hr., in the amount of labor used and in the cost of
operation.
• Assume that at least a certain amount of product must be
produced and that we would like to utilize at least the
regular labor force.
• How much should we utilize on each machine in order to
utilize total costs and still meets the requirement?
• Note:
• In maximization problems, our point of
interest is looking the furthest point from the
origin (Maximum value of Z).
• In minimization problems, our point of
interest is looking the point nearest to the
origin (Minimum value of Z).

You might also like