0% found this document useful (0 votes)
70 views

2.2 Graphical Method Minimization

I. The document discusses several concepts in linear programming including: - Maximizing profit or minimizing cost as objectives - Decision variables and constraints - Graphical method to solve linear programming problems II. It also discusses some special situations that can occur with linear programming problems including: - Multiple optimal solutions - Unbounded solutions - Infeasible solutions where the constraints cannot be satisfied III. Examples are provided to demonstrate solving linear programming problems to determine the optimal values of decision variables.

Uploaded by

jackielyn garlet
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views

2.2 Graphical Method Minimization

I. The document discusses several concepts in linear programming including: - Maximizing profit or minimizing cost as objectives - Decision variables and constraints - Graphical method to solve linear programming problems II. It also discusses some special situations that can occur with linear programming problems including: - Multiple optimal solutions - Unbounded solutions - Infeasible solutions where the constraints cannot be satisfied III. Examples are provided to demonstrate solving linear programming problems to determine the optimal values of decision variables.

Uploaded by

jackielyn garlet
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Linear Programming

Quantitative Techniques
Chapter III. Management Accounting Concepts
and Techniques for Decision-Making
A manufacturer produces a product which

Before we is either canned or bottled. Daily machine


capacity is at 320 man hours. The bottled

proceed, try
product needs 2 hours per unit, while each
unit of the canned product requires 1 1/2
hours. The manufacturer is committed to

solving this... supply a customer at least 60 cans


everyday. If the objective is to maximize

profit, how many units of the bottled and
the canned products should be produced?
A manufacturer produces two products A

Before we and B with objective to maximize profit =


20x + 4y subject to constraints 10x + 8y <_

proceed, try 44 and 4x + 2y <_ 14. Find x and y and the


maximum profit.

solving this...

Graphical Method: Minimization Problem


Same as in maximization problem, the
technique of using the graphical
method works equally well in solving
minimization problem.

In minimization problem, instead of solving for


maximum profit, we now solve for minimum
cost.
Arambulo Company owns two mills. Company policy
dictates that the company should operate at least as
many hours at the second mill as at the first. The first
mill operates at a maximum of 40 hours per week and

Let's try the second mill at a maximum of 60 hours per week.


For each hour of operation, the first mill can produce 3

solving tons of finished product, while the second mill can


produce 4 tons. The company has a contract to supply

this...
customers for at least 175 tons of finished product. It
cost P2,000 per hour to operate the first mill and
P4,000 per hour for the second mill. if the company's

objective is to minimize the cost, how many hours in a


week should each mill operate in order to fulfill the
company's commitments to its customers at the least
cost at least cost?
Solution
III. Subject to:

I. Decision Variables:
Let x = no. of hours/week of the first mill
y = no. of hours/week of the second mill

II. Objective Function


Min. Cost = P2,000x + P4,000y
(0,60)
(0,58)

(40,0)
Let's try A 50-kilo mixture is composed of two ingredients A and
B costing P190 and P235 respectively. If at least 15 kilos

solving each of A and B should be used with A not exceeding


30 kilos, how much of each of the two ingredients A and

this... B should there be in the mixture for optimum cost?

Let's try A 50-kilo mixture is composed of two ingredients A and


B costing P190 and P235 respectively. If at least 15 kilos

solving each of A and B should be used with A not exceeding


30 kilos, how much of each of the two ingredients A and

this... B should there be in the mixture for optimum cost?

Special Situations LP Problem with


Multiple Solutions
It is also possible for an LP

problem to have an

unbounded solution. That is no constraint is

LP Problem with put on the objective allowing for an infinitely


large solution and therefore an infinitely large
Multiple Solutions profit in which no real situation permits.

Multiple solutions to a linear Another way where an LP problem can fail to


programming problem is possible. When have an optimal solution is the inability of the
situation like this occur, it means that the solution to satisfy all constraints. The
firm has an extraordinary flexibility in the constraints are so restrictive that there is no
selection of its product-mix, so that any way of staisfying them. No feasible solution is
combination will result in maximum found. This condition is called infeasibility.
profit.

You might also like