IE5001 Tutorial 3 Questions
Question 1
An airlines must determine how many connecting flights daily can be arranged between Juneau, Alaska, and Dallas, Texas. Connecting flights must stop in Seattle and
then stop in Los Angeles or Denver. Because of limit

2013 Final Exam Answers
Question 1a
In this problem, unit profit contribution varies from product to product, but resource
constraints remain the same. Denoting unit profit contribution of Product C by , the
model is as follows.
max Z = 2x 1 + (2 1)x 2 +

2014 Final Exam Answers
Question 1a
Decision on the location of firestations can be represented by binary variables x i which
take a value of 0 if station i it is closed & 1 if is open. The objective function is total
number of firestations that are requi

IE5001
NATIONAL UNIVERSITY OF SINGAPORE
FACULTY OF ENGINEERING
IE5001 OPERATIONS PLANNING AND CONTROL I
(Semester I: 2014/2015)
Time Allowed: 2 hours
INSTRUCTIONS TO CANDIDATES:
1.
Please write your Student Number only. Do not write your name.
2.
This ass

IE5001 Tutorial 1 Questions
Question 1
A small furniture manufacturer produces three different kinds of furniture: desks, chairs,
and bookcases. The wooden materials have to be cut properly by machines. In total,
100 machine-hours are available for cuttin

2011 Final Exam Answers
Question 1a
We first identify the basic variables. They have zero coefficient in the z-row and coefficient of 1 in the rest of the rows. They are, row 1, row 2 & row 3: x 3 , x 4 & x 5 respectively.
The non-basic variables are x 1

IE5001
NATIONAL UNIVERSITY OF SINGAPORE
FACULTY OF ENGINEERING
EXAMINATION FOR
Semester I: 2011-2012
IE5001 OPERATIONS PLANNING AND CONTROL I
November 2011 Time Allowed: 2 hours
INSTRUCTIONS TO CANDIDATES:
1. This paper contains FIVE (5) questions and com

NATIONAL UNIVERSITY OF SINGAPORE
FACULTY OF ENGINEERING
IE5001 OPERATIONS PLANNING AND CONTROL I
Semester I: 2013/2014
Name of Examiner: Dr See Chuen Teck
December 2013 Time Allowed: 2 hours
INSTRUCTIONS TO CANDIDATES:
1.
This paper contains 4 questions a

IE5001 Tutorial 1 Answers
Question 1
Let x 1 , x 2 , x 3 be the number of units of desks, chairs, and bookcases to be produced,
respectively. Since 100 total machine-hours are available for cutting, the production of
x 1 , x 2 and x 3 should use no more t

IE5001 Tutorial 3 Answers
Question 1
The network diagram is shown in the figure. It is a maximum flow problem. The capacity of arc (i , j ) is the maximum number of daily flights between city i and city j . Using
inspection, we see that the optimal soluti