OR Modelling¶

• Decision Variable
• Objective Function
• Objective Line
• Operations Research
• Optimization Model
• OR Study Cycle
• Algorithm
• Constraint
• Feasible Solution
• Linear Programming
• Model Parameter
• Nonnegativity Constraint
• Optimal Solution
• Feasible Region
• Graphical Method
• Heuristic
• Linear Program Formulation
• Multiple Optimal Solutions
• Relaxation
• Vehicle Routing Problem
• Bin Packing Problem
• Corner Point
• Corner Point Optimality
• Diet Problem
• First-Fit Heuristic
• Giapetto Production Model
• Optimization Bounds

Review week 1 in Concept Finder 27 concepts

• Binary Variable
• Excel Solver for Linear Programming
• Integer Linear Programming
• Minimization-to-Maximization Transformation
• Mixed Integer Program
• Negative RHS Transformation
• Production-Inventory Model
• Pure Integer Program
• Slack Variable
• Surplus Variable
• Transportation Problem
• Unrestricted Variable Transformation
• Augmented Form
• Basic Solution
• Basic Variable
• Binary Integer Program
• Bus Scheduling Model
• Nonbasic Variable
• Project Selection Model
• Simplex Tableau
• Task Quota Assignment
• Ambulance Location Model
• Artificial Variable
• Basic Feasible Solution
• Entering Variable Rule
• Minimum-Ratio Test
• Simplex Method
• Simplex Optimality Test
• Simplex Pivot
• Two-Phase Method
• Unbounded Linear Program
• Infeasible Linear Program

Review week 2 in Concept Finder 32 concepts

• Capacity Expansion Model
• Contingent Decisions
• Convex Combination of Optimal Solutions
• Degeneracy
• Either-Or Constraints
• Graphical Integer Programming
• Job Sequencing Model
• K-Out-of-N Constraints
• LP Relaxation
• Mutually Exclusive Decisions
• Nonconvex Region Modelling
• Parity Constraint
• Rounding Heuristic
• Sensitivity Analysis
• Shadow Price in Linear Programming
• Branch-and-Bound
• Excel Sensitivity Report
• Finite-Value Constraint
• Incumbent Solution
• Objective Coefficient Range
• Reduced Cost
• RHS Sensitivity Range
• Branch-and-Bound Pruning

Review week 3 in Concept Finder 23 concepts

• Network
• Path in a Network
• Undirected Network
• Vertex Degree
• Connected Network
• Cycle
• Directed Network
• Euclidean Network
• Euler Tour
• Königsberg Bridge Problem
• Maximum Flow Problem
• Residual Network
• Shortest Path Problem
• Tree
• Augmenting Path
• Augmenting Path Algorithm
• Euler Network Characterization
• Euler Tour Algorithm
• Minimum-Weight Perfect Matching
• Shortest Path Algorithm
• Spanning Tree
• Chinese Postman Problem
• Minimum Spanning Tree
• Dijkstra-Prim Method
• Kruskal Method

Review week 4 in Concept Finder 25 concepts

• Assignment Problem
• Bipartite Matching
• Dummy Assignment
• Forbidden Assignment
• Inventory Policy
• Maximum Flow Linear Program
• Newsvendor Model
• Ordering Cycle
• Purchasing Cost
• Setup Cost
• Shortest Path Binary Formulation
• Zero-Cost Matching via Maximum Flow
• Assignment Cost Transformation
• Holding Cost
• Hungarian Algorithm
• Minimum Zero Cover
• Project Longest Path Model
• Shortage Cost
• Classical EOQ Model
• Dynamic Lot-Size Model
• Economic Order Quantity
• Effective Lead Time
• EOQ with Lead Times
• EOQ with Planned Shortages
• EOQ with Price Breaks
• Price-Break Indifference Quantity

Review week 5 in Concept Finder 26 concepts

• Dynamic Programming
• Lot-Size Bellman Recursion
• Positive Part
• Silver-Meal Heuristic
• Standard Normal Distribution Probability Theory for EOR
• Underage Cost
• Zero-Inventory Ordering Property
• Overage Cost
• Critical Ratio
• Discrete Newsvendor Rule
• Newsvendor Price Sensitivity
• Continuous Newsvendor Rule
• Normal Demand Distribution
• Uniform Demand Distribution
• Weibull Demand Distribution

Review week 6 in Concept Finder 15 concepts