Please place your name on each page NOW!
IE 383 Service Operations Management
Mark S. Daskin
Name
Dept. of IE/MS
Spring, 2008
Northwestern University
IE 383 Service Operations Management
FINAL EXAM
Grading:
Degree of
difficulty
Moderate
(computational
que

Name
SOLUTIONS
Write your name on each page NOW!
IE 383 QUIZ
Problem 1
Consider the tradeoff between the average distance and the maximum distance in a location problem.
Every demand node in each solution is assigned to the closest selected facility.
The

IOE 491, Service Operations Management
Winter, 2011, IOE Dept, U. Michigan
Name
Place your name on all pages now!
Quiz 1
There are 3 problems on this test. They are weighted as follows:
Problem
Maximum
Points
Your Score

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 7 Solutions
Instructor: Viswanath Nagarajan
Due on 4/5/16
1. (20 points) Consider the following postal operations scenario. There is a delivery vehicle
located at the post office (location a) whi

Please put your name on every page
IE 383 Service Operations Management
Mark S. Daskin
Dept. of IE/MS
Spring, 2008
Northwestern University
QUIZ
Problem 1: (60 percent)
Consider the problem of finding districts for salespeople. There are two objectives whi

Isha Gupta
Ross Essay 1
1. Describe why you want to pursue a BBA degree at the Ross School of Business, and
how the Ross experience will support your personal and professional goals. (500 word
maximum)
Many believe that psychology is solely a study of the

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Minimum Spanning Tree
Instructor: Viswanath Nagarajan
1
Lecture 12,13
Introduction
An internet company wants to set up connections to all houses in a neighborhood. Given data on
the length

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 7
Instructor: Viswanath Nagarajan
Due on 4/5/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another per

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 6
Instructor: Viswanath Nagarajan
Due on 3/23/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another pe

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 5
Instructor: Viswanath Nagarajan
Due on 3/15/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another pe

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 4 Solutions
Instructor: Viswanath Nagarajan
Due on 2/19/16
1. Consider a shortest path instance on nodes cfw_A, B, C, D, E, F, G, H with the following arcs:
(A, B) cost 2; (A, E) cost 4; (B, F )

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 3 Solutions
Instructor: Viswanath Nagarajan
Due on 2/10/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 4
Instructor: Viswanath Nagarajan
Due on 2/19/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another pe

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 3
Instructor: Viswanath Nagarajan
Due on 2/10/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another pe

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 8
Instructor: Viswanath Nagarajan
Due on 4/15/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing another pe

5
Problem 5. A warehouse stocks up to C units of some product. You are asked to plan for a period
of n days. The demand on day i is known in advance to be d units, for each I = l,2,. , n. You
may order additional items on any day: the ordering cost is K d

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Traveling Salesman Problem
Instructor: Viswanath Nagarajan
1
Lecture 19
Introduction
A logistics company needs to plan the route for its truck to visit demand locations. Given distances
bet

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Topological Sort
Instructor: Viswanath Nagarajan
1
Lecture 1,2
Introduction
Consider the following car manufacturing example. There are n tasks that need to be performed
in making a car (at

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Time Complexity of Algorithms
Instructor: Viswanath Nagarajan
1
Lecture 2,3
Introduction
An algorithm is a systematic method for solving an optimization problem. Although this notion
dates

IOE 491: Advanced Optimization Methods
Winter 2016
Sample Midterm Questions
Instructor: Viswanath Nagarajan
These are sample questions to prepare for the midterm exam. I will not provide solutions to these
questions. You are encouraged to try them yoursel

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Maximum Flow
Instructor: Viswanath Nagarajan
1
Lecture 15,16,17,18
Introduction
Consider a supply-chain network with distribution links between pairs of locations and a limit on
the the max

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Basic Network Definitions
Instructor: Viswanath Nagarajan
Lecture 3
Many of the optimization problems in this class will be defined on networks (also called graphs).
A network/graph represe

_
Winter 2016
JOE 491: Advanced Optimization Methods
Midterm Exam
Name:
oJ rn
PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY.
Please sit in alternating seats. You are not allowed to talk to other students during the exam.
Before submitting your exam,

IOE 491: Advanced Optimization Methods
Winter 2016
Homework 2 Solutions
Instructor: Viswanath Nagarajan
Due on 1/28/16
Honor code: You may discuss homework problems with other students. However the submitted
work should be your own. Copying or rephrasing

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Large Scale Linear Programs
Instructor: Viswanath Nagarajan
1
Lecture 20,21,22
Introduction
In a number of applications, one needs to solve linear programs with a very large number of
varia

IOE 491: Advanced Optimization Methods
Winter 2016
Lecture Notes: Convex Programming
Instructor: Viswanath Nagarajan
1
Lecture 23
Introduction
Many applications need to be modeled using non linear objectives/constraints. Examples include
dynamical systems

IOE 491, Service Operations Management
Winter, 2011, IOE Dept, U. Michigan
Name
Place your name on all pages now!
Quiz 2
There are 3 problems on this test. They are weighted as follows:
Problem
Maximum
Points
Your Score

IOE 491
Mark S. Daskin
Service Operations Management
IOE Department
Winter, 2012
University of Michigan
Problem set 1
SOLUTIONS
Other than problem 1,
all other problems should be handed in using a hard copy
Problem 1: To help us get to know you better, pl

IOE 491
Mark S. Daskin
Service Operations Management
IOE Department
Winter, 2012
University of Michigan
Problem set 3
DUE: February 13, 2012
All problems should be handed in using a hard copy
Problem 1:
Do problem 4.1 in the text
No. Consider a problem wi

IOE 491
Mark S. Daskin
Service Operations Management
IOE Department
Winter, 2012
University of Michigan
Problem set 4
DUE: Monday, March 12, 2012
All problems should be handed in using a hard copy
Problem 1:
The projected monthly demand for fertilizer pro