Scribd
Upload
36 views

3 Linear Programming Problems

This document discusses linear programming problems with two variables that involve finding the maximum or minimum value of a linear objective function subject to linear constraints. It states that for bounded feasible regions, the objective function will have both a maximum and minimum value occurring at corner points of the region. Several examples are provided of problems involving maximizing profit subject to production capacity or cost constraints.

Uploaded by

nknknkn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

3 Linear Programming Problems

This document discusses linear programming problems with two variables that involve finding the maximum or minimum value of a linear objective function subject to linear constraints. It states that for bounded feasible regions, the objective function will have both a maximum and minimum value occurring at corner points of the region. Several examples are provided of problems involving maximizing profit subject to production capacity or cost constraints.

Uploaded by

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

Linear Programming Problems

with two variable


A linear programming problem with two variable is
finding maximum or minimum value of a linear equation

subject to linear constraints (restrictions)


� 1 � +�1 � ≤ �1
� 2 �+ �2 � ≤ � 2
⋮
� � � +�� � ≤� �
�≥0
� ≥0

where ; and are real constants.


Theorem: Let R be the feasible region for a linear
problem, and let Z=ax+by be the objective function.
If R is bounded, then the objective function Z has both
a maximum and minimum value on R and each of
these occurs at a corner point of R
Example:
Example:
Remark: If R is unbounded, then a maximum or a
minimum value of the objective function may not
exist. However, if it exist, it must occur at a corner
point of R. (By Theorem 1)
Example:
Example:
Example:
Example:
Example:
Find maximum and minimum value of

subject to
Example:
Find maximum and minimum value of

subject to
Example:
A food producer uses two processing plants, P1 and P2 that operates 7 days a week. After
processing, beef is graded into high-, medium- and low-quality foodstuffs. High-quality beef
is sold to butchers, medium quality beef is used in super-market ready-meals and the low-
quality beef is used in dog food. The producer has contracted to provide 120 kg of high-, 80
kg of medium- and 240 kg of low-quality beef each week. It costs $4000 per day to run
plant P1 and $3200 per day to run plant P2. Each day P1 processes 60 kg of highquality
beef, 20 kg of medium-quality beef and 40 kg of low-quality beef. The corresponding
quantities for P2 are 20 kg, 20 kg and 120 kg, respectively. How many days each week
should the plants be operated to fulfil the beef contract most economically?
Example:
A small manufacturer produces two kinds of good, A and B, for which demand exceeds
capacity. The production costs for A and B are $6 and $3, respectively, each, and the
corresponding selling prices are $7 and $4. In addition, the transport costs are 20 cents and
30 cents for each good of type A and B, respectively. The conditions of a bank loan limit the
manufacturer to maximum weekly production costs of $2700 and maximum weekly
transport costs of $120. How should the manufacturer arrange production to maximize
profit?
Example:
A manufacturer produces two models of racing bike, B and C, each of which must be
processed through two machine shops. Machine shop 1 is available for 120 hours per
month and machine shop 2 for 180 hours per month. The manufacture of each bike of
type B takes 6 hours in shop 1 and 3 hours in shop 2. The corresponding times for C are 4
and 10 hours, respectively. If the profit is $180 and $220 per bike of type B and C
respectively, how should the manufacturer arrange production to maximize total profit?
Example:
Example:

You might also like