chapter-20.qxd
3/25/03
9:24 PM
Page ii
Chapter 20
Statistical Quality
Control
GOALS
When you have completed this chapter, you will be able to:
Discuss the role of quality control in production and service
operations
Define and understand the terms chance
Part IV: Planning and Managing
Inventories in A Supply Chain
Chapter 12: Determining the Optimal Level of
Product Availability
Mattel, Inc. & Toys R Us
Mattel was hurt last year by inventory cutbacks at Toys R Us,
and officials are also eager to avoid a r
Chapter 6 Exercise Solutions
Notes:
1. New exercises are denoted with an .
2. For these solutions, we follow the MINITAB convention for determining whether a
point is out of control. If a plot point is within the control limits, it is considered to be
in
Project Management for Information Systems
by James Cadle and Donald Yeates
End of chapter Questions and Answers
Chapter 1 Managing change
Q1 Figure 1.7 shows how bad an implementation can become. Action needs to be taken to
prevent this kind of situation
Chapter 8: Aggregate Planning in a Supply Chain
Exercise Solutions :
We define a comprehensive set of decision variables that are utilized in problems 8-1 to
8-3 depending on the problem context.
Decision Variables:
Ht = # of workers hired in month t (t =
IE 4515 Fall 2013 Final Exam Topics
The topics covered will be as follows
Description and definition of the field of Operations Research
Typical phases of an OR Project
What is a linear program (LP)?
What components are included in the formulation of
IE 4515 Fall 2013 Final Exam Topics
The topics covered will be as follows
Description and definition of the field of Operations Research
Typical phases of an OR Project
What is a linear program (LP)?
What components are included in the formulation of
MtDTEQM #1 SOLUHON.
2
1. (12 points) For Questions 1 - 4, label each statement as TRUE or FALSE.
(a) All linear programs (LPs) have at least one extreme point. P
(b) The simplex method will only evaluate feasible solutions. I
(C) The simplex methods minim
Homework Assignment #5 IE 4515 Fall 2013
Due Date: 10/24/2013
Book Problems
5.1-10
5.1-14 (d) and (e) - Hint: Read Section 5.1
5.2-1 (a) only In addition to identifying the optimal solution also identify the optimal objective
function value.
Additional Pr
Homework Assignment #5 IE 4515 Fall 2013
Due Date: 10/24/2013
Book Problems
5.1-10
5.1-14 (d) and (e) - Hint: Read Section 5.1
5.2-1 (a) only In addition to identifying the optimal solution also identify the optimal objective
function value.
Additional Pr
Homework Assignment #6
Due Wednesday, November 6
You may use IOR Tutorial to solve problems. If you do so, include your printout in your write-up and
make sure to annotate the print out as necessary to explain your solution and how you arrived at it.
Reme
Name _
Quiz #3 IE 4515 Fall 2013
Examine the LP formulation and the graph of the feasible region below.
maximize Z = x1 + 3x2 - 4x3
subject to
x1 + 2x2 - 4 x3 12
x1 - x2 + 5 x3 10
x1 0, x2 0, x3 0
1) Write the LP in standard form. Rewrite the objective fu
a. (4 pts) Suppose you solve an LP using the simplex method, and at the optimal basis you
have all non-basic variables with a negative coefficient in the (0) row. Then the problem has
_ optimal solution(s).
(a) one
(b) two
(c) infinite
(d) an unknown numb
Clarification of Discussion on 11/6/13
<= Constraints
>= Constraints
From the graphs above, we see that
1. If we have a maximization problem,
a. The value of cj increases by , then the objective function will increase by at least xj*
b. The value of cj de
Note: You will need to use the IOR Tutorial Software to complete this assignment. It can be
downloaded at the link (http:/highered.mcgraw-hill.com/sites/0073017795/student_view0/ior_tutorial.html). Include
your printout in your write-up, and make sure to
Homework Assignment #6
Due Wednesday, November 6
You may use IOR Tutorial to solve problems. If you do so, include your printout in your write-up and
make sure to annotate the print out as necessary to explain your solution and how you arrived at it.
Reme
Name 8 (St-0 (NS
Quiz #6 IE 4515 Fall 2013
Answer the following questions using the network below.
1) Find the shortest path between Node 0 and Node T, using the algorithm we discussed in class.
n Connected Closest Total nt
The Transportation and Assignment Problems
IE 4515 Fall 2013 Prof. Grin
Chapter 8
Chapter 8: The Transportation and Assignment Problems
Outline
Outline
The Transportation Problem (Section 8.1)
The Assignment Problem (Section 8.3)
Chapter 8: The Transporta
You may use IOR Tutorial to solve problems. If you do so, include your printout in your write-up and
make sure to annotate the print out as necessary to explain your solution and how you arrived at it.
Remember:
- Homework must be typed or written neatly
Homework Assignment #6
Due Wednesday, November 6
You may use IOR Tutorial to solve problems. If you do so, include your printout in your write-up and
make sure to annotate the print out as necessary to explain your solution and how you arrived at it.
Reme
Note: You will need to use the IOR Tutorial Software to complete this assignment. It can be
downloaded at the link (http:/highered.mcgraw-hill.com/sites/0073017795/student_view0/ior_tutorial.html). Include
your printout in your write-up, and make sure to
Homework Assignment #7
Due Friday, November 22 by 5 pm EST
You must submit your homework via Blackboard (see the bottom of the Assignment page) or placed in
the folder on Prof. Griffins door.
There will be a quiz on this same material on Monday November 2