Book Report Assignment
IE 1035 - Engineering Management
Spring Term 2017
This is an individual assignment. You will need to read a book related to engineering management and
then write a report on the book. You may select a book from the attached list of
IE 1035: Engineering Management
Spring Term 2017
Assignment #3 Chapter 5
Assigned:
Due:
Tuesday, January 24, 2017
Tuesday, January 31, 2017
Be sure to read Chapter 5 to reinforce the concepts covered in the lecture notes.
See problem 5-8 from Chapter 5 (P
IE 1035: Engineering Management
Spring Term 2017
Assignment #2 Chapter 4
Assigned:
Tuesday, January 17, 2017
Due:
Tuesday, January 24, 2017
_
Part 1:
Problems:
Sales of a particular product for the past five years were as follows:
Year
Sales (thousands of
IE 1035: Engineering Management
Spring Term 2017
Assignment #1 Chapters 1 and 2
Assigned:
Due:
Thursday, January 5, 2017
Thursday, January 12, 2017
Discussion questions from Chapter 1:
1.
What are the similarities in the definitions of Management quoted f
POSTOPTIMALITY ANALYSIS
(aka SENSITIVITY ANALYSIS)
Objective: To analyze the optimum solution to see how
sensitive this solution is w.r.t. the cost coefficients and the
right-hand-side values.
Consider our example:
Maximize z = 5000x1 + 4000x2
st
10x1 + 1
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 12)
Use the branch and bound method to solve the following IP:
Maximize Z = 5X1+4X2
st
X1 + X2 5
10X1 + 6X2 45
X1, X20 and integers
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 10: Due April 14, 2016)
Question 1:
Find the minimum spanning tree for the following network:
23
15
17
42
50
48
33
9
31
22
11
30
12
19
46
35
31
41
37
8
13
7
29
Question 2:
In the following network, find t
I.E.2001 OPERATIONS RESEARCH
(Homework Assignment 7: Due Thursday, Mar. 17, 2016)
Question 1:
Construct the duals for each the following LP problems do not try solving anything!
Minimize
st
Z = 4x1 + 3x2
2x1 + x2 25
-3x1 + 2x2 15
x1 + x2 15
x1, x2 0
Maxim
I.E. 2001 OPERATIONS RESEARCH
(Solutions to Assignment 9)
Question 1 (Q20, p. 504-505)
Define AB = 1 if a rep is assigned to states A and B, 0 otherwise;
BC = 1 if a rep is assigned to states B and C, 0 otherwise; etc. etc.
Note that this is a set coverin
THE "OPERATIONS RESEARCH METHOD"
Orientation
Problem Definition
F
E
E
D
B
A
C
K
Data Collection
Model Construction
Solution
Validation and Analysis
Implementation & Monitoring
201, Jayant Rajgopal
An OR Problem - A Simple Example
SCENARIO
PAR, Inc. is a
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 11: Due April 21, 2016)
Question 1:
Consider the following set of activities. Construct the project network. Identify the critical activities just by inspection (i.e., without
using the critical path meth
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 8: SOLUTIONS)
Question 1: (Q4, p.399)
Since Persons 2 and 3 can do two jobs each we make two copies of each of these persons assign
to allow for this possibility. Thus we now have 5 "people" and 4 jobs so
I.E. 2001 OPERATIONS RESEARCH
(Solutions to Assignments 7)
Question 1
Z = 4x1 + 3x2
2x1 + x2 25
-3x1 + 2x2 15
x1 + x2 15
x1, x2 0
All inequality constraints are "normal" ( for a Min problem) so we can proceed.
The dual is
1)
Minimize
st
Maximize
st
W = 25
GRAPH:AnetworkofNODES(orVERTICES) andARCS (orEDGES)joining
thenodeswitheachother
DIGRAPH:AgraphwherethearcshaveanORIENTATION (orDIRECTION).
a
b
c
a
Graph
Digraph
e
d
d
c
A CHAINbetweentwonodesisasequenceofarcswhereeveryarchasexactly
onenodeincommonwithth
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 11: Solutions)
Question 1.
G, 4
B, 3
E, 5
H, 2
L, 7
START
0
F, 4
A, 4
M, 8
I, 3
K, 5
C, 8
D, 6
J, 5
FINISH
0
By examining all possible paths from the Start to the Finish node, the longest path appears to
INTEGER PROGRAMMING
Pure Integer Programs: all decision variables
restricted to integer values
0-1 programs
general IP problems
Mixed Integer Programs: some variables restricted to
integer values; others may be continuous
0-1 programs
general IP probl
The SIMPLEX Method - Development
Every LP is in exactly one of the following states:
1. Feasible with a unique optimum solution.
2. Feasible with infinitely many optima.
3. Feasible, with no optimum solution (because the objective
is unbounded).
4. Infeas
I.E. 2001 OPERATIONS RESEARCH
(Homework Assignment 9: Due April 7, 2016)
Question 1
1. Question 20 (WSP Publishing), at the end of Section 9.2 on page 504-505 of the text
formulate and then use LINDO/Excel Solver to solve this.
2. Suppose that the compan
GETTING AN INITIAL BFS WHEN THE ORIGIN IS NOT
IN THE FEASIBLE REGION
This could happen in the presence of and = constraints.
e.g., Max z = 2x1 + 5x2 + 3x3
st 3x1 - 6x2 30
6x1 +12x2 +3x3 =75; x1, x2, x3 0.
In standard form this yields
Max z = 2x1 + 5x2 + 3
I.E. 2001 OPERATIONS RESEARCH
(Solutions to Assignment 5)
Question 1
a) Here x1, x4, x5 are all nonbasic and all have a value of zero, while x3, x2, x6 are basic,
with values of 65, 205 and 480 respectively.
b) For minimization x1 and x4 are legitimate ca
I.E. 2001 OPERATIONS RESEARCH (Spring 2016)
(Solutions to Assignment 3)
Question 51, p. 122
Let
X1 = number of transistors worth of germanium melted by method 1
X2 = number of transistors worth of germanium melted by method 2
RD = number of defective tran
I.E. 2001 OPERATIONS RESEARCH
(Solutions to Assignment 6)
QUESTION 1
Output is shown below; the variable definitions are as stated in the solutions to
Assignment 3 that were posted earlier.
MIN
50 X1 + 70 X2 + 25 RD + 25 R1 + 25 R2 + 25 R3
SUBJECT TO
2)
0
I.E. 2001 OPERATIONS RESEARCH
(Spring 2016: Solutions to Assignment 4)
Question I.
First add nonnegative slacks or subtract nonnegative excess variables (from the first two
constraints) to make all constraints equalities. Then multiply both sides of equat
I.E.2001 OPERATIONS RESEARCH
(Homework Assignment No. 4: Due Feb. 11, 2016)
I.
Restate the following LP so that it is in the standard form - do NOT try solving it.
Max -3X1 + X2 - 2X3 + X4
-4X1 + X2 + X3
> 4
3X1 - X2 + 2X3
< -6
X2 + 4X3 - X4 = -1
st
2X1 -