,ACE ISYE 6501 EXAM 3 WITH THIS COMPLETE GEORGIA TECH OMS STUDY GUIDE.
UPDATED 2026/2027
Includes 35+ exam-style Q&A with answers on:
- Probability: Weibull, Exponential, Poisson distributions.
Memoryless property. K<1 in Weibull = failure rate
decreases.
- Optimization: variables, constraints objective function.
Integer programs take longer. Linear regression minimizes
squared error.
- Simulation: Models that imitate real systems.
Mixed/randomized strategies.
- Machine learning: Neural network process, K- Means
clustering formula.
- Time series: exponential smoothing formula and alpha
interpretation.
- Data: Binary vs continuous imputation difficulty.
- Design of Experiments and Approximate Dynamic
Programming
Clear, direct answers. No fluff. Perfect for last-minute review of exam 3 topics.
FOR GEORGIA TECH OMS ANALYTICS STUDENTS. GRADED A+.
, COMPREHENSIVE QUESTIONS AND ANSWERS
◍ Weibull distribution.
Answer: Continuous probability distribution that is often used to model the time until failure of a
device, component, etc.: ( )=( / )(x/ )^( 1) * ^(−( / )^ ) for ≥0.
◍ What are the three main components of the optimization models?.
Answer: variables, constraints, objective function
◍ Time between people entering a grocery store (binomial, exponential, geometric, Poisson,
Weibull).. Answer: Exponential
◍ Mixed strategy/randomized strategy.
Answer: A strategy where a participant's action is determined randomly according to probabilities
- for example, in "rock, paper, scissors", someone who randomly chooses between the three
options with probability 1/3 each is using a mixed strategy.
◍ Do most systems exhibit the memoryless property?.
Answer: things usually depend on the past, which make it not this
◍ Design of experiments.
Answer: Choosing a set of tests to be made to find the effect of input variables on an outcome.
◍ When is regression effective in variable selection?.
Answer: If there aren't significant interactions between the factors.
◍ What is the objective function in linear regression?.
, Answer: trying to minimize the squared error in linear regression is an example of this
◍ Which one is harder, imputing binary variable or continuous variable?.
Answer: Binary, because if you chose wrong, you are completely wrong
◍ Approximate dynamic program.
Answer: Dynamic programming model where the value functions are approximated.
◍ If the interarrival time is exponential what type of distribution is the arrival. Answer: poisson
◍ What does k < 1 mean in a weibull distribution.
Answer: modeling when failure rate decreases with time; worst things fail first (mechancial parts),
the parts that are left are the better ones and take longer to fail
◍ Upper tail.
Answer: Highest-value part of a distribution
◍ Simulation.
Answer: A model that imitates the operation or behavior of a real system.
◍ What is the process of neural networks?.
Answer: * Each input neuron accepts a single piece of information * for example, if we are trying
to solve the CAPTCHA problem we might divide the picture of a digit into pixels and every
pixel's status between fully white and fully black goes to its own input neuron* As inputs come in,
they're passed to the first level of hidden neurons. Each simulated neuron calculates a weighted
value of those inputs and sends the result to neurons at the next level. Those next level neurons do
UPDATED 2026/2027
Includes 35+ exam-style Q&A with answers on:
- Probability: Weibull, Exponential, Poisson distributions.
Memoryless property. K<1 in Weibull = failure rate
decreases.
- Optimization: variables, constraints objective function.
Integer programs take longer. Linear regression minimizes
squared error.
- Simulation: Models that imitate real systems.
Mixed/randomized strategies.
- Machine learning: Neural network process, K- Means
clustering formula.
- Time series: exponential smoothing formula and alpha
interpretation.
- Data: Binary vs continuous imputation difficulty.
- Design of Experiments and Approximate Dynamic
Programming
Clear, direct answers. No fluff. Perfect for last-minute review of exam 3 topics.
FOR GEORGIA TECH OMS ANALYTICS STUDENTS. GRADED A+.
, COMPREHENSIVE QUESTIONS AND ANSWERS
◍ Weibull distribution.
Answer: Continuous probability distribution that is often used to model the time until failure of a
device, component, etc.: ( )=( / )(x/ )^( 1) * ^(−( / )^ ) for ≥0.
◍ What are the three main components of the optimization models?.
Answer: variables, constraints, objective function
◍ Time between people entering a grocery store (binomial, exponential, geometric, Poisson,
Weibull).. Answer: Exponential
◍ Mixed strategy/randomized strategy.
Answer: A strategy where a participant's action is determined randomly according to probabilities
- for example, in "rock, paper, scissors", someone who randomly chooses between the three
options with probability 1/3 each is using a mixed strategy.
◍ Do most systems exhibit the memoryless property?.
Answer: things usually depend on the past, which make it not this
◍ Design of experiments.
Answer: Choosing a set of tests to be made to find the effect of input variables on an outcome.
◍ When is regression effective in variable selection?.
Answer: If there aren't significant interactions between the factors.
◍ What is the objective function in linear regression?.
, Answer: trying to minimize the squared error in linear regression is an example of this
◍ Which one is harder, imputing binary variable or continuous variable?.
Answer: Binary, because if you chose wrong, you are completely wrong
◍ Approximate dynamic program.
Answer: Dynamic programming model where the value functions are approximated.
◍ If the interarrival time is exponential what type of distribution is the arrival. Answer: poisson
◍ What does k < 1 mean in a weibull distribution.
Answer: modeling when failure rate decreases with time; worst things fail first (mechancial parts),
the parts that are left are the better ones and take longer to fail
◍ Upper tail.
Answer: Highest-value part of a distribution
◍ Simulation.
Answer: A model that imitates the operation or behavior of a real system.
◍ What is the process of neural networks?.
Answer: * Each input neuron accepts a single piece of information * for example, if we are trying
to solve the CAPTCHA problem we might divide the picture of a digit into pixels and every
pixel's status between fully white and fully black goes to its own input neuron* As inputs come in,
they're passed to the first level of hidden neurons. Each simulated neuron calculates a weighted
value of those inputs and sends the result to neurons at the next level. Those next level neurons do
