OSCM 230
Homework 13 Solutions
HOMEWORK #13 SOLUTIONS
DECISION ANALYSIS
Problem 828.
(a) Conduct survey. If results are favorable, build large shop. If the results are unfavorable, don't build any shop. (b) EVSI = $11,000. EVwPI = $35,400. Best EMV = $19

OSCM 230
Homework #12 Solutions
HOMEWORK #12 SOLUTIONS
PROJECT SCHEDULING
Chapter 7: 17, 22, 29, 36 7-17. See file P7-17.XLS. (a)
F A K I End H
Star
B E
G
J C D
(b & c) Act A B C D E F G H I J K a 3 2 1 6 2 6 1 3 10 14 2 m 6 4 2 7 4 10 2 6 11 16 8 b 8 4

OSCM 230
Homework 9 Solutions
HOMEWORK #9 SOLUTIONS S I MU L A T I O N M O DE L I N G Problem 1030 See file P1030 CB.XLS for the simulation model and calculations using Crystal Ball. Define cell B11 as the Forecast cell. Based on 5,000 trials, average pro

OSCM 230
Homework 08 Solutions
HOMEWORK #8
SIMULATION
MODELING
Problem 1017. See file P1017 CB.XLS for the simulation model and calculation using Crystal Ball. Based on 3,000 trials, the average ending balance at the end of the year is $47. There is also

OSCM 230
Homework 07
HOMEWORK #7
NONLINEAR PROGRAMMING
6-38. Let X1 = number of four-cylinder engines to produce, and X 2 = number of six-cylinder engines to produce. Objective: Maximize profit = X1(1,800 - 50X1) + X2(2,400 - 70X2) = 1,800X1 50X12 + 2,400

OSCM 230
Homework 06
HOMEWORK #6 SOLUTIONS
INTEGER PROGRAMMING
1. A startup problem Define Ai=1 if generator A is on in period i, 0 otherwise, i=1,2. Bi=1 if generator B is on in period i, 0 otherwise, i=1,2. Ci=1 if generator C is on in period i, 0 other

OSCM 230
Homework 05
HOMEWORK #5 SOLUTIONS
INTEGER PROGRAMMING
6-18. There are 8 decision variables (A, H, E, N, S, M, B, and R) corresponding to the eight investment options. Each variable can take only one of two values: = 1 if the investment is chosen,

OSCM 230
Homework 04 Solution
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Problem 48. In most cases, when the Allowable Increase or Allowable Decrease column for the objective function coefficient of a variable has a value of zero in the Adjustable Cells tab

OSCM 230 Homework #3
HOMEWORK #3(SOLUTIONS)
LINEAR PROGRAMMING (LP) FORMULATION 1. The problem is investing in the four securities so as to achieve maximum total return. Define: TB = amount to invest in Treasury Bonds CS = amount to invest in Common Stock

OSCM 230
Homework 02
HOMEWORK #2
LINEAR PROGRAMMING (LP) FORMULATION
3-2. Let C = number of canvas backpacks produced. P, N, L defined similarly. Objective: Maximize profit = cost)*P + cost)*L = Subject to: 2.25C 2.40P 2.10N 2.60L 1.5C + 1.5P 1.7N C, C, P

OSCM 230
Homework 01 Solution
LINEAR PROGRAMMING (LP) FORMULATION
Problem 240 a. Let: X = number of pounds of stock X purchased per cow each month Y = number of pounds of stock Y purchased per cow each month Z = number of pounds of stock Z purchased per c