-
Constrained Non-Linear Optimization, the conditions hiding the optimum
Discovering how the Karush-Kuhn-Tucker conditions connect the objective function and constraints to characterize optimal solutions
-
Gomory fractional cuts, the power of a good cut
Discover how Gomory cuts eliminate fractional solutions to bring us closer to the optimal integer solution
-
Finding the needle without searching the entire haystack
An intuitive introduction to the Branch and Bound algorithm
-
Modeling Decisions with Binary Variables
Learning to formulate implications, disjunctions, fixed costs, and other common constraints in integer optimization
-
From Continuous to Integer Optimization: The Power of Integer Variables
Exploring how a small tweak in a model gives rise to a whole new class of optimization problems
-
Beyond the Optimum, keys to Post-Optimization
An intuitive explanation of how to analyze the stability of an optimal solution using post-optimization techniques
-
Simplex in Reverse, understanding the Dual Simplex Algorithm
An intuitive introduction to the Dual Simplex algorithm, its foundations, and how to initialize it.
