MATH 3170 6.00 A SU 2012
Solutions to selected problems from Sections 8.2, 8.3 and 8.4.
8.2.2
We begin by permanently labeling node 1 and assigning temporary
labels to other nodes: [0* 2 8 ]. Then we
MATH 3170 6.00 SU 2012
Solutions to selected problems from Sections 7.1-7.3, 7.5 and 7.6.
Note: The algorithms used below allow for a lot of flexibility and therefore,
it is possible that different/al
YORK UNIVERSITY
Faculty of Science and Engineering
Faculty of Liberal Arts and Professional Studies
MATH 3170 6.00 A
Test #3
July 25, 2012
Surname (print): _ _ _ _ _ _ _ _ _ _ _
Given Name: _ _ _ _ _
MATH 3170 6.00 A SU 2012
Solutions to selected problems from Sections 9.2, 9.3 and 9.4.
9.2.12
Let y1 = 1 if NY is used, y2 = 1 if LA is used, y3 = 1 if Chicago is
used, y4 = 1 if Atlanta is used. Als
MATH 3170 6.00 A SU 2012
Solutions to selected problems from Sections 4.4-4.10
4.4.1
From Figure 2 of Chapter 3 we see that the extreme points of the feasible
region are:
H
E
F
G
D
=
=
=
=
=
Basic Fea
MATH 3170 6.00 A SU 2012
Solutions to selected problems from Sections 3.1-3.6
Questions marked: 3.2.6, 3.3.3, 3.4.3, 3.5.6, 3.6.4.
3.1.3
1 bushel of corn uses 1/10 acre of land and 4/10 hours of labor
MATH 3170 6.00 A SU 2012
Solutions to selected problems from Sections 3.7-4.1
3.7.1
Graphically, we find the optimal solution to be x1 = 50, x2 = 100, with
optimal value z = 2500.
3.8.10
Let Mi = Tons