OR POST study plan
OR POST · Give each week a clear focus.
8 weeks · About 7 hours per week
Operations Research Foundations and Model Formulation & Linear Programming: Formulation, Geometry, and Duality
Formulate five word problems (production mix, blending, staffing, diet, transportation) as LP models with clearly labeled decision variables, objective, and constraints
Convert three LPs into standard form and identify basic feasible solutions by hand for a two-variable case
Classify constraint types (binding, redundant, equality) and predict how each changes the feasible region before graphing
Derive the dual of three primal LPs and state the complementary slackness conditions from memory
Your checkpoint
A one-page model-formulation cheat sheet plus five fully worked LP formulations with duals, self-graded against a written checklist
Linear Programming: Formulation, Geometry, and Duality
Solve two-variable LPs graphically and verify optimal vertices by enumerating corner points
Apply the simplex method by tableau to three LPs, including one with an artificial-variable start
Interpret shadow prices, reduced costs, and RHS ranging from a sensitivity report in words
Identify infeasible, unbounded, and degenerate cases and explain the distinguishing tableau or geometric signal for each
Your checkpoint
A worked solutions packet of six LPs (graphical plus simplex) with a sensitivity interpretation paragraph for each
Network Optimization and Integer Programming
Model shortest path, minimum spanning tree, max flow, and min-cost flow problems from verbal descriptions
Solve one max-flow instance by hand using augmenting paths and verify the result with a min-cut
Formulate three combinatorial problems (knapsack, set covering, assignment) as integer programs with correct binary variables
Explain why LP relaxation bounds work and describe one branch-and-bound tree by hand
Your checkpoint
A network-and-IP problem set of eight solved instances, including one hand-drawn branch-and-bound tree with bounds annotated
Probability, Stochastic Processes, and Queueing Theory & Network Optimization and Integer Programming
Apply the total probability law and Bayes' rule to four conditional-probability scenarios
Compute steady-state probabilities for a small discrete-time Markov chain by solving the balance equations
Derive performance measures (L, Lq, W, Wq, utilization) for M/M/1 and M/M/c queues from given rates
Select the appropriate queueing model for three described service systems and justify the choice
Your checkpoint
A queueing formula card plus four fully worked queueing and Markov-chain problems with numeric answers
Decision Analysis, Utility, and Game Theory & Discrete-Event Simulation and Statistical Analysis
Build a decision tree for a three-stage decision with chance nodes and roll back to the optimal policy
Compute expected value of perfect information and interpret risk profiles for a risky versus safe alternative
Explain expected utility, risk aversion, and the St. Petersburg-style paradox in writing
Find pure and mixed Nash equilibria in two 2x2 games and identify dominated strategies
Your checkpoint
A decision-analysis write-up containing one rolled-back decision tree with EVPI and one game-theory solution set with equilibria justified
Discrete-Event Simulation and Statistical Analysis
Design a discrete-event simulation model for a service system, specifying entities, events, and state variables
Implement or hand-trace a small simulation run and compute output statistics with confidence intervals
Explain variance reduction (common random numbers, antithetic variates) and when each applies
Distinguish terminating from steady-state simulation and choose warm-up and run length accordingly
Interpret input-distribution fitting and goodness-of-fit results for a given data set
Your checkpoint
A simulation experiment report with model description, 10 replications, confidence intervals, and a validity discussion
Nonlinear and Dynamic Programming & Operations Research Foundations and Model Formulation
Classify optimization problems by convexity and identify local versus global optima
Apply KKT conditions to two constrained nonlinear problems and interpret multipliers
Formulate and solve a three-stage dynamic program by backward recursion
State the principle of optimality and map a shortest-path problem to a DP formulation
Your checkpoint
A nonlinear-and-DP problem set of five solved problems with KKT or recursion steps shown in full
Applications, Modeling Practice, and Professional Ethics & Linear Programming: Formulation, Geometry, and Duality & Probability, Stochastic Processes, and Queueing Theory
Critique three flawed model formulations for assumption violations and propose fixes
Draft written responses to two professional-ethics scenarios involving data misuse and conflicted client interests
Complete a timed 40-question mixed-topic practice set and log error causes by domain
Re-derive the dual and complementary slackness conditions and two queueing formulas from memory as a retention check
Your checkpoint
A timed practice exam score report with an error log and a one-page ethics response sample
Milestones
Week 2: Solve two unseen two-variable LPs graphically and by simplex within 30 minutes each, with correct duals written alongside
Week 4: Score at least 70% on a self-made 20-question quiz covering domains 1-3, with no more than two errors in duality or network formulation
Week 6: Produce correct L, Lq, W, and Wq for two queueing scenarios and a decision tree with EVPI computed correctly, unaided
Week 8: Achieve at least 75% on the timed mixed practice set, with every missed item assigned a root cause and a re-study action