OR Success Stories
Some Success Stories
Optimal crew scheduling saves American Airlines $20
Improved shipment routing saves Yellow Freight over
Improved truck dispatching at Reynolds Metals improves
on-time delivery and red
Insights from Geometry1
Professor Paul Calamai
University of Waterloo
May 11, 2009
1.4 Applied Mathematical Programming, S. Bradley, A. Hax and T.
Magnanti, Addison-Wesley, 1977.
Gain useful insight into characteristics of
Figure 1.8.3. Illustration of three iteratiens of the simplex method, which gem
mate the paints 2:3, 3:4, and :35, starting from the simplex; 3:9,.12, 3:3. The simplex
obtained after these uee iterations consists of 3:2, :34, and 3:5.
A Greedy Algorithm Approach
Find the largest value of cij in the table
Assign Salesperson i to Zone j
Remove Salesperson i (row) and Zone j (column) from the table
Repeat until all assignments are made
1.1 A Classication of Optimization Algorithms 23
Branch and - Algebraic .- :
Bound Geometry '
Soft Computing I fw [
330 Numerical Methods and Optimization: An Introduction
FIGURE 13.3: Illustration of steepest descent iterations.
So, vgvk = 0, k 2 0 and HVf(:t*)H2 2 line Vf+1vk = 0. II!
In the proof, we have shown that if we apply the method of steepest de-