Optimization
- Annealing
- Anonymous
- Ant Colony Algorithm
- Auction
- Banzhaf Power Index
- Biggest Little Hexagon
- Biggest Little Polygon
- Branch and Bound Algorithm
- Building Problem
- Cake Cutting
- Convex Optimization Theory
- Criss-Cross Method
- Crossing the Desert Problem
- Desert Problem
- Differential Evolution
- Duality Theorem
- Ellipsoidal Calculus
- Evolution Strategies
- Genetic Algorithm
- Global Optimization
- Graham's Biggest Little Hexagon
- Griewank Function
- Integer Programming
- Interior Point Method
- Jeep Problem
- K-Means Clustering Algorithm
- Kuhn-Tucker Theorem
- Lagrange Multiplier
- Lagrangian Multiplier
- Largest Small Hexagon
- Largest Small Octagon
- Levenberg-Marquardt Method
- Linear Optimization
- Linear Programming
- Little's Law
- Longest Path
- Merit Factor Problem
- Method of Steepest Descent
- Monotonic Voting
- Nelder-Mead Method
- Number Partitioning Problem
- Operations Research
- Optimization Theory
- Robbins-Monro Stochastic Approximation
- Rosenbrock Function
- Semidefinite Programming
- Set Covering Deployment
- Set-Covering Deployment
- Simplex Method
- Simulated Annealing
- Stochastic
- Stochastic Function
- Stochastic Optimization
- Synergetics
- Tabu Search
- Tent Problem
- Traveler's Problem
- Traveling Salesman Constants
- Traveling Salesman Problem