A condition that must be satisfied, represented by equations or

Warm up –
Create a list of every vocab word you
can think of from this semester.
See how many you can get. (there
will be a winner)
NO NOTES!
And I wouldn’t help my friend
either…
A condition that must be satisfied,
represented by equations or
inequalities
Constraint
A quantity that the decisionmaker controls
Decision Variable
A mathematical technique for
finding the optimal value of a linear
objective function subject to linear
constraints when the decision
variables can take on fractional
values.
Linear Programming
The term that describes a
mathematical expression in linear
programming that maximizes or
minimizes some quantity
Objective Function
The feasible solution with the best
value for the objective function
Optimal Solution
The amount of a resource that is not
used in the optimal solution
(Linear Programming)
Slack
A set of lattice points in the feasible
region of an
integer programming problem that
are candidates for the optimal
solution, because they are closest to
the boundary of the feasible
region
Kernel
Any point whose xand
y-coordinates are both integers
Lattice Point
The distance between two points
(x1, y1) and (x2, y2), measured
along axes at right angles
Rectilinear Distance
The first existing facility location
where the cumulative weight of
the existing facilities up to that point
is at least half of the total
weight of all existing facilities
Median Location
The path through the digraph
that has a slack value of zero
Critical Path
The earliest time at which an activity
can be finished, assuming that
it starts at the earliest start time
Earliest Finish Time
(EFT)
The earliest time at which an event
can begin; the preceding
activities are assumed to start at
their earliest start times
Earliest Start Time
(EST)
The representation of timings of
activities by means of bars drawn
against common time-scale
Gantt Chart
The difference between the
earliest and latest event-time
Slack (critical path method)
Nodes, arcs, decisions, random
events
Parts of a decision tree
If A and B are independent events
then the probability of A and B
both happening equals the
probability of A times the probability
of
B
Multiplication Rule
If there are m possible outcomes for
one event and n possible
outcomes for a second event then
there are m × n possible ways in
which both events can occur
Fundamental Principle of
Counting
The outcomes for events A and B
do not effect each other
Independent Events
A diagram similar to a probability
tree to model a situation
representing possible scenarios
depending on decisions in addition
to random events
Decision Tree
The probability distribution that is
used to find the likelihood of a
particular number of successes (x)
for a given number of trials (n)
Binomial Distribution
The probability distribution that is
used to find the likelihood of a
particular trial (r) being the first
success.
Geometric Distribution
arithmetic average:
Add each of the sampled items and
divide by the number of items
Mean
A bell shaped distribution that is
symmetric about the mean
Normal Distribution
A statistic measure that describes
how spread out the data is.
Standard Deviation
The standard deviation squared
Variance
A test that is at the end of the
course that is cumulative from the
whole semester
FINAL EXAM!