-Homework #08 Solutions:
-1. 14.3-1 p826. Formulate. Find the gunner's optimal strategy using LINGO. Find
the soldier's optimal strategy using LINDO. Verify that the value of the
game is the same in both cases. Specify the optimal solution for both
Case Study Instructions
-Case Study 2 for this semester is Case 7 from the textbook (p1362), called
BestChip: Expansion Strategy. However, we will use different data than that in
the textbook. That data is posted in an Excel spreadsheet on the cla
Data for Winston Case 7: BestChip Expansion Strategy, p1362
Note: Please use road miles rather than air miles for city distances.
$0.085 Shipping cost per ton-mile
13,500 Production capcity of each plant (tons)
Table 20 - Site Information and Material S
Data for Case 4, Vision Corporation: Production Planning and Shipping, p. 1355
6275 Total pounds of material available
2445 Capacity of the special inspection site
Table 8 - Product-Resource Constraints - Plant 1
LINGO Sample Solutions
-List of Sample LINGO Solutions:
1. Multi-Period Inventory/Production Problem (Sailco)
2. Worker Scheduling Problem (Post Office)
3. Transportation Problem (Powerco)
4. Assignment Problem (Machineco)
5. Shortest Path Problem
-Homework #10 Solutions:
-1. 9RP-27 p556. Milk delivery. Solve using either LINGO, LINDO or Excel. Specify
the optimal solution using the terminology of the problem.
9RP-27. Let yi = 1 if Truck i is used and yi = 0 otherwise. Also define xij = 1 if
ISE 230 Quiz 3
November 12, 2008
1. (40 points) Suppose that a company has a varied cost structure for one of its
products. To entice customers to try the product, the first five units purchased
by a customer cost only $49 pe
Winston Book Errata
Errata for Operations Research - Applications and Algorithms, 4th Ed.
lines 16 & 33
ISE 230 Quiz 2
October 15, 2008
1. (50 points) Suppose we need to ship automobile parts from 5 production
facilities to 3 auto parts outlets, that we are given the transportation costs
per part shipped and the supply and dema
Winston CD Install Notes
These instructions apply to the CD accompanying our textbook, Operations
Research, Applications and Algorithms (with CD-ROM and InfoTrac), by Wayne L.
Winston, 4th edition, 2004, Duxbury Press, ISBN 0-534-38058-1.
According to the
ISE 230 Quiz 1
September 17, 2008
1. (50 points) Set up and solve the following linear programming problem using
the 2-Phase method:
min z =
6 (constraint 1)
12 (constraint 2)
-Homework #13 Solutions:
-1. 20.3-2 p1072. Birth-death model for light bulb replacement. Hints: (1) Let
the state be the number of working bulbs. (2) If two bulbs are working,
the failure rate is twice that of a single bulb. Similarly with he
-Homework #05 Solutions:
-1. 7.1-1 p371. Starting with the northwest corner bsf to the problem 7.1-1, use
the transportation simplex method to find the optimal solution. Show your
work for all iterations, including the ui and vj values, loop, etc.
-Homework #09 Solutions:
-1. 9.2-9, 9.2-10 and 9.2-11 p503. For 9.2-9, use 3, 5, 8, and 13 as the possible
values for x (rather than 1, 2, 3, and 4). No answer in back of book for
9.2-9. (18 points)
y1 = 1 if x = 3, y2 = 1 if x = 5, etc.
Max Flow Problem Algorithm:
(0) on each arc (i,j), write the forward arc
capacity on the arc near i and the reverse
capacity (or 0 if none) near j.
(1) find a path from source to sink with
positive remaining flow capacity.
PERT Example - Widgetco section 8.4 - (project diagram in fig 31, p434)
Note that the table below only includes activities that are on the critical path:
Assume normal distn with
Find Pcfw_finish by
-Homework #06 Solutions:
-1. Suppose we just completed an iteration of the transportation-problem simplex
method. Suppose xkl was the entering variable and xij was the leaving
variable. Now we re-compute the ui's and vj's for the next iteration. What
-Homework #11 Solutions:
-1. 17.3-1 p931. Population migration Markov chain. Use matrix multiplication in
Excel to find the long-run population percentages.
17.3-1 Solution: U=Urban S=Suburban R=Rural. Then
-Homework #12 Solutions:
-1. 20.2-1 p1062. M/M/7/FCFS/8/ queuing system.
20.2-1. After the first service completion, I enter service. By the no memory
property of the exponential distribution, I am no more or less likely to complete
service before any of
-Homework #07 Solutions:
-1. 8.5-4 p455. Formulate part (a) as a MCNF problem and solve using LINGO.
Specify the optimal solution and total cost from the LINGO solution. For part
(b), just show how the network would change; don't resolve the problem.
-Homework #04 Solutions:
-1. 6.2-1 p274. Be sure to show all of your calculations. Hint 1: Use B-1 and
related formulas to find the final tableau, including (1) all coefficients in
row 0, including the rhs, (2) the x1, x2, s1 and s2 columns, and the rhs c
-Homework #02 due Wednesday 9/10/08:
-1. 4.4-1, p139.
4.4-1. From Figure 2 of Chapter 3 we see that the extreme points of the feasible
Basic Feasible Solution
H = (0, 0)
s1 = 100, s2 = 80, s3 = 40 x1 = x2 = x3 = 0
E = (40, 0) x1 = 40, s1 = 20,
Green Sheet - Fall 2008
ISE 230 Advanced Operations Research #40846
Section 1 - W 6:00-8:45pm - ENGR 486
Instructor: Steve Kennedy
Office: ENGR 485B
Office Hours: W 5:00-5:45pm
Course description: Advanced operations research techniques and