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

Linear Programming

The document presents 4 examples of linear programming problems. Example 1 involves maximizing profit from manufacturing tents with constraints on available labor hours. The optimal solution is to produce 20 standard tents and 6 expedition tents for a maximum profit of $1,480. Example 2 involves minimizing costs to meet nutritional needs for chickens with constraints on nutrients. The minimum cost of $2.80 is achieved with 8 pounds of mix A and 3 pounds of mix B. Example 3 involves minimizing transportation costs to take 400 students on a trip with constraints on available chaperones. The minimum cost of $9,900 is achieved renting 7 buses and 15 vans. Example 4 involves maximizing profit from furniture production with constraints on available labor hours. The maximum

Uploaded by

Helbert Agluba Paat
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
1K views

Linear Programming

The document presents 4 examples of linear programming problems. Example 1 involves maximizing profit from manufacturing tents with constraints on available labor hours. The optimal solution is to produce 20 standard tents and 6 expedition tents for a maximum profit of $1,480. Example 2 involves minimizing costs to meet nutritional needs for chickens with constraints on nutrients. The minimum cost of $2.80 is achieved with 8 pounds of mix A and 3 pounds of mix B. Example 3 involves minimizing transportation costs to take 400 students on a trip with constraints on available chaperones. The minimum cost of $9,900 is achieved renting 7 buses and 15 vans. Example 4 involves maximizing profit from furniture production with constraints on available labor hours. The maximum

Uploaded by

Helbert Agluba Paat
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Section 5-3 Geometric Approach to Linear Programming in

Two Dimensions
Example 1
A manufacturer of lightweight mountain tents makes a standard model and
an expedition model for national distribution. Each standard tent requires 1
labor-hour from the cutting department and 3 labor-hours from the assembly
department. Each expedition tent requires 2 labor-hours from the cutting
department and 4 labor-hours from the assembly department. The maximum
labor-hours available per day in the cutting department and the assembly
department are 32 and 84 respectively. If the company makes a profit of $50
on each standard tent and $80 on each expedition tent, how many tents of
each type should be manufactured each day to maximize the total daily
profit (assuming that all tents can be sold)?
Tent
Standar
d
Expediti
on

Cutti
ng
x1 x2
0 1
6
3 0
2

#
x
1

x
2

Cutting
Assem
bly
Profit

Assem
bly
x1 x2
0 21
28 0

Standa
rd
x1
3x1
50x1

Expediti
on
+
2x2
+
4x2

Constrai
nt
32
84

Maximiz
e

80x2

The feasible region is shaded in the graph below. The


cutting constraint is shown in red and the assembly
constraint is shown in green. The lines intersect at
(20, 6) corresponding to 20 standard tents and 6
expedition tents. (The line for the maximum profit
equation has been added.)

0
0
0

0 16

50 1280
20 6 80
1480

28 0
1400

The maximum profit


$1,480 when 20
standard and 6
expedition tents are
manufactured each
day.

is

Example 2
A chicken farmer can buy a special food mix A at 20 per pound and another
special food mix B at 40 per pound. Each pound of mix A contains 3,000
units of nutrient N1 and 1,000 units of nutrient N2 while each pound of mix B
contains 4,000 units of nutrient N1 and 4,000 units of nutrient N2. His flock
requires at least 36,000 units of nutrient N1 and 20,000 units of nutrient N2
every day. How many pounds of each mix should he use each day to meet
the nutritional needs of his chickens at the minimal cost? What is the
minimal cost per day?
Mi
x
A
B

Poun
ds
x1
x2

Nutrient
N1
x1
x2
0
9
12
0

0
8

20

Mix A
Units of
N1
Units of
N2
Cost
Nutrient
N2
x1
x2
0
5
20
0

3000
x1
1000
x1
0.20
x1

Mix B Constrai
nt
+ 4000

x2
36000
+ 4000

x2
20000
+ 0.40 Minimiz
x2
e

The feasible region is illustrated below. The


nutrient N1 line is shown in red and the nutrient
N2 line in green. The lines intersect at (8, 3)
corresponding to 8 pounds of mix A and 3
pounds of mix B. (The line for the minimum cost
equation has been added.)

$3.60
0.20

3
$2.80
0
.
40

$4.00
0

The minimum cost is $2.80 per day when 8 pounds of nutrient N1 and 3
pounds of nutrient N2 are used each day.

Example 3
The officers of a high school senior class are planning to rent buses and vans
for a class trip. Each bus can transport 40 students, requires 3 chaperones,
and costs $1,200 to rent. Each van can transport 8 students, requires 1
chaperone, and costs $100 to rent. They must plan for at least 400 students
but only 36 parents have volunteered to serve as chaperones. How many
vans and buses should they rent to minimize transportation costs? What is
the minimum transportation cost?
Vehicl #
e
Bus
x
1

Van

x
2

Studen
ts
x1 x2
0 50
10 0

Bus
Students
Chaperon
es
Cost

40x1
3x1

Van
B
+ 8x2
+ x2

Constrai
nt
400
36

1200
x1

+ 100
x2

Minimiz
e

Chaperon
es
x1
x2
0
36
12
0

The feasible region is shown below. The student constraint is shown in red
and the chaperone constraint in green. The lines intersect at (7, 5)
corresponding to 7 buses and 15 vans. (The line for the minimum cost
equation has been added.)

10
12

0
12000
1200

0
14400

100
9900
15

The minimum cost is $9,900 when 7 buses and 15 vans


are rented. This solution will require all 36 chaperones
and can transport 400 students.

Example 4.
A furniture manufacturing company manufactures dining room tables and
chairs. A table takes 8 hours to assemble and 2 hours to finish. A chair takes
2 hours to assemble and 1 hour to finish. The maximum number of laborhours per day is 400 for the assembly process and 120 for the finishing
process. If the profit on a table is $90 and the profit on a chair is $25, how
many tables and chairs should be made each day to maximize the profit
(assuming that all of the tables and chairs can be sold)?
Furnitu
re
Table

Chair

x
1

Assem
bly
Finishin
g
Profit

Tabl
e
8x1
2x1

90x

+ 25x2

Assem
bly
x1 x2
0 20
0
5
0
0

Chair
B
+ 2x2
x2

Constrai
nt
400
120
Maximiz
e

Finishi
ng
x1 x2
0 12
0
6
0
0
The feasible region is shown below. The red line
represents the assembly time constraint and the
green line represents the finishing time constraint.
The lines intersect at (40, 40) corresponding to 40
tables and 40 chairs. (The line for the maximum
profit equation has been added.)

0
0
0

0 125

90 3125
40 40 25
4600

0
50
4500

The maximum profit of $4,600 per day requires that


40 tables and 40 chairs be manufactured each day.

You might also like