IEOR 162
Homework 1
Linear Programming & Network Flows - Page 1 of 5 Out: August 26, 2016
Due: September 2, 2016
1. A medical equipment company produces a piece of diagnostic equipment at two factories. Three
medical centers have placed orders for this mo
IEOR 162: PROBLEM SET 4
DUE OCT 2
For this problem set, please submit an electronic copy of your solutions. In this problem
set, you will set up four spreadsheets. One spreadsheet for each problem. Please set up
the all the spreadsheets in one Excel le. F
IEOR 162
Sample Final Exam Question
Topic: Revised Simplex Algorithm
Professor Arbel
November 26, 2012
by
Andr Bakland, Tian Liu, and Alicia Zecherle
Problem statement: Solve using the revised simplex algorithm. What is the solution
called? Hint: You do n
E7 Sample Questions Solutions
Angela, Gerd, Nate, and Toby
May 10, 2013
NOTE: These sample questions are meant to give you a taste of what you could encounter in the nal.
Solving these questions does NOT give you a complete feedback for your exam preparat
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Fall 2015)
Homework 0
Due: Friday, August 28th
This assignment will be graded but will not count for credit.
In your answers be sure to clearly defi
Davis Ng
IEOR 162
Exam Problem: Revised Simplex Algorithm
Maximize: 2X1+X2+X3
Such That:
2X1+X3<= 50
X1+2X2+X3<=60
X3+X2 <=40
X1,X2,X3 >=0
Solution:
Rewritten in standard form:
X1=25 X2=17.5 S3=22.5 max is 67.5
Maximize: 2X1+X2+X3
Such That:
2X1+X3+S1= 50
Solution to IEOR 162 Midterm Fall 2007 (30 points total for any three questions)
1. The optimal solution is found to be z = 12, x1 = 0, x2 = 6.
Grading: Feasible region (5) Isoprofit line (3) Unique solution (2) 2. Let x1 = Units of Process 1.
x2 = Units
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Fall 2015)
Homework 4
Due: Friday, Sep 25th
Question 1. The manager of a computer help center needs to determine a shift schedule for his staff. The
IEOR 162, Spring 2011
Suggested Solution to Sample Midterm 1
1. (a) The graphical solution is shown in the gure below. The feasible region is the shaded
zone. The dashed line is the isoprot line, and the arrow is the improving direction. The
problem is un
IEOR 165 Spring 2004 Final Exam May 19, 2004 5.00 - 8.00 pm 2 Leconte Q1. A random sample of size 10 is taken from population X. Suppose the sample mean is 102 and the sample variance is 121. Also a random sample of size 15 is taken from population Y. For
IEOR 162, Fall 2011
Homework 10
1. (Problem 9.2.10; 5 points) If x and y are integers, how could you ensure that at least one of x + y 3
and 2x + 5y 12 is satised?
2. (Problem 9.2.11; 5 points) If x and y are integers, how could you ensure that whenever x
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Fall 2015)
Homework 2
Due: Friday, Sep 11th
Question 1. An investor has money-making activities A and B available each year for the next 5 years.
Ea
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Fall 2015)
Homework 5
Due: Friday, October 2nd
Question 1. A company can make a product in three sizes - large, medium, and small - that yield a net
Department of Industrial Engineering & Operations Research
IEOR162 Linear Programming
Exam 1 03/19/2003
Name:
Grade:
1. (20 points) Draw the feasible region of problem (P). Illustrate two isoprot lines and show the direction of improvement in the objectiv
IEOR 162 Final Exam Problem (Sensitivity Analysis)
Seung Hun Ham (20957715)
Question
Berkeley Investment decided to invest $100 in a bond and a stock. They found that the bond yields 10% interest
rate and the stock yields 20% dividend yield. They also fou
IEOR 162, Fall 2011
Homework 01
1. (Modied from Problem 3.2.3; 10 points) Leary Chemical manufactures three chemicals: A, B, and
C. These chemicals are produced via two production processes: 1 and 2. Running process 1 for an
hour costs $4 and yields 3 uni
IEOR 162, Fall 2011
Homework 08
Note. If an LP has n variables and m constraints (excluding nonnegativity constraints), its dual LP MUST
have n constraints (excluding nonnegativity constraints) and m variables.
1. (Modied from Problem 6.3.6; 20 points) Su
UNIVERSITY OF CALIFORNIA Industrial Engineering and Operations Research
Midterm Exam Spring 2002
LINEAR PROGRAMMING IEOR162 Professor Dorit Hochbaum
Attempt all five questions. Show all your work. If you feel you need more space use the back of the preced
IEOR 162 Linear Programming Spring 2007
Discussion Section Handout 3
Some modeling problems: 1. It's Monday and you have $200. You're objective is to maximize the amount of money you have on Friday. Each day of the week, you can choose to invest any
IEOR 162, Fall 2011
Homework 07
1. (Modied from Problem 6.1.4; 17 points) Consider the Dorian Auto problem as below:1
Dorian Auto manufactures luxury cars and trucks. The company believes that its most
likely customers are high-income women and men. To re
Department of Industrial Engineering & Operations Research
IEOR162 Linear Programming
SAMPLE Midterm Exam 1
Fall 2011
Name: SAMPLE Midterm Exam 1
Grade: SAMPLE Midterm Exam 1
1. Consider the following linear program
max 3x1 2x2
s.t. x1 x2 5
2x1 x2 4
x2 4.
IEOR 162, Fall 2011
Homework 11
1. (10 points) Four jobs must be processed on a single machine. The hours required to perform each job
and the due time (in hours) for each job are shown in the table below. Use the branch-and-bound
method to determine the
Timmy Siauw, Alexandre Bayen
An Introduction to MATLAB Programming
and Numerical Methods for Engineers
January 16, 2013
Foreword
This book includes the material taught at UC Berkeley in the class E7, Introduction to computer programming
for scientists and
E7 Practice Midterm
March 8, 2013
1
A=1, B=0
What will (A=A)&(B=B) give you? and what
will (A=B)&(B=A) give you?
A) 0 , 0 respectively
B) 1 , 1 respectively
C) 0 , 1 respectively
D) 1 , 0 respectively
E) none of the above
2
C=[8 4 10 2 3];
C(end-3) w
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Spring 2016)
Class time & location
Lecture: MW 9-10A, 3106 Etcheverry
Discussion: F 9-10A, 3106 Etcheverry
Instructor
Professor Dorit S. Hochbaum
E-
1. D
2. E
3. D
4. C
5. E
6. A
7. C
8. B
9. B
10.
E (C is a true statement, but will return the vector [1,1]
rather than just 1)
11.
D
12.
D
13.
D
14.
D
15.
D
16.
A (You could also change Line 9 and fix the error, but thats
not an option; key is that both
Department of Industrial Engineering & Operations Research
IEOR162 Linear Programming
Nlidterm Exam Fall 2009
Name: Grade:
1. (25 points)
Draw the feasible region of LP 3,: solve it graphicall}r Illustrate two isoprot lines and SllOW the
direc
E7 Practice Midterm
March 8, 2013
1
A=1, B=0
What will (A=A)&(B=B) give you? and what
will (A=B)&(B=A) give you?
A) 0 , 0 respectively
B) 1 , 1 respectively
C) 0 , 1 respectively
D) 1 , 0 respectively
E) none of the above
1
A=1, B=0
What will (A=A)&(
Department of Industrial Engineering & Operations Research
IEOR 162: Linear Programming and Network Flows (Spring 2017)
Group project
Due: Friday, April 28th
Managing Operations at Pineapple
Pineapple is a small-sized company that produces high quality co
Department of Industrial Engineering & Operations Research
IEOR 162 Linear Programming and Network Flows (Spring 2017)
Dijkstras algorithm (1956)
Requirements
All arcs have non-negative cost. Cycles are allowed.
Key concepts
At each iteration, the shorte
Department of Industrial Engineering & Operations Research
IEOR 162 Linear Programming & Network Flows (Spring 2017)
Shortest paths application: Equipment replacement
A single machine is needed to perform a specified function for the next four years, afte
Department of Industrial Engineering & Operations Research
IEOR 162 Linear Programming and Network Flows (Spring 2017)
Dynamic Programming for DAG (Directed Acyclic Graph)
Requirements
The graph has no cycles. Negative costs are allowed.
Concept: Topologi