OR Models
Problem Set #7
Fall Semester 2011
No Due Date
In each problem, formulate as a Markov chain means that you should (i) clearly dene
the states and (ii) rate-transition diagram. For the following questions, use the Markov
Processes (CTMC) Add-In, a

OR Models
Problem Set # 6
Fall Semester 2010
Due: Thursday, November 17
NOTE 1: In each problem, formulate as a Markov chain means that you should (i) clearly
dene the states, (ii) give the state-transition diagram, and (iii) give the one-step transition

OR Models
Problem Set # 5
Fall Semester 2011
Due: Tuesday, November 1
1. Solve problem 3 from Chapter 9 of Jensen and Bard.
2. Consider problem 8 from Chapter 9 of Jensen and Bard.
(i) You dont have to classify the problem with the level of detail describ

OR Models
Problem Set # 4
Fall Semester 2011
Due: Friday, October 21
For each problem: Formulate and the associated integer program or network-ow problem.
Unless indicated otherwise, solve the problem using the OR MS Network or Linear/Integer
Add-in. Repo

OR Models
Problem Set # 3
Fall Semester 2011
Due: Thursday, October 6
For each problem: Construct (i.e., draw and label) the network of the associated
minimum-cost ow problem. Unless indicated otherwise, solve the problem using the
OR MS Network add-in. R

OR Models
Problem Set # 2
Fall Semester 2011
Due: Thursday, September 22
1. Solve problem 13 from Chapter 2 of Jensen and Bard.
2. Solve problem 3 of Chapter 2 from Jensen and Bard as follows: In part (a), solve
the problem using the graphical solution me

OR Models
Problem Set # 1
Fall Semester 2011
Due: Tuesday, September 13
Solve problems 7, 8, 12 and 15 from Chapter 2 of Jensen and Bard.
Note: Your answers should consist of:
(1) A handwritten LP formulation (i.e., an Excel worksheet is not sucient). Be

OR Models
Practice Exam #2
Fall Semester 2011
Name:
No books, notes or calculators are allowed in this exam.
1. (35 pts) Three particles are divided between two cells, cell #1 and cell #2. A cell may contain
0, 1, 2, or 3 particles. During each period, on

OR Models
Practice Exam #1
Fall Semester 2011
Name:
No books, notes or calculators are allowed in this exam.
1. (20 pts) Consider the following linear program.
minimize
subject to
500
6
8
50x1
20x2
30x3
400x1 +200x2 +150x3
3x1
+2x2
20
2x1
+4x2
+x3 50
2

Operations Research Models
ME 366L (#18765)
Classroom:
Fall Semester 2011
ETC 4.150
Meeting Time: 03:30-5pm on Tuesdays and Thursdays
Prerequisites:
Multivariable Calculus (M 408D or similar) and Intro to Programming (ME 205 or similar)
Instructor:
Alexan

Installation of Excel Solver add-in
1 Click big round button (top left corner)
2 Click Excel Options, go to the Add-ins and there press Go. button
3 Check Solver Add-in, click Ok.
4 Microsoft Office Excel can't run the addin-in message will pop up. Click

OR Models
Sample Final Exam
Fall Semester 2011
Name:
No books or notes are allowed in this exam, beyond your own two-sided 8.5 11 paper with notes.
Use of a calculator is permitted. Unless noted otherwise, you must show your work and reasoning
in order to

Notation and Terminology
N(t ) = # of customers in the system at time t 0
Pk(t ) = probability exactly k customers in system at
time t, given # in system at time 0
s = # of parallel servers
k = mean arrival rate (expected # of arrivals per unit
time)
k =

Markov Chain Transition Matrix
Type: DTMC
Title: DTMC_1
Change
Economics
Transient
Steady State
n-step Probabilities
First Pass
Simulate
Absorbing States
Step
Calculate Measure
Cells
Analyze
State
Index
Names
0
State 1
1
State 2
2
State 3
3
State 4
4
Stat

Name:
Type:
Goal:
Drivers:
Linear Model
TRUE
FALSE
TRUE
FALSE
FALSE
100
100
0
60
Change
LP_1
LP1
Min
26
Solver: Jensen LP/IP
Type: Linear
Sens.: No
Side: No
Ph. 1 Iter.
7
Total Iter.
7
Comp. Time 00:00
Status Optimal
Solve
Variables
Name:
Values:
Vary
1
X