Source: Wikipedia. Pages: 183. Chapters: P versus NP problem, Pareto efficiency, Optimization, Operations research, Genetic algorithm, Least squares, Dynamic programming, Genetic programming, Semi-continuity, Quadratic programming, Random optimization, Calculus of variations, Lagrange multiplier, Optimal design, Metaheuristic, Optimal control, Non-linear least squares, NP-complete, Oriented matroid, No free lunch in search and optimization, Ordinal optimization, Multidisciplinary design optimization, Distributed constraint optimization, Bellman equation, Hyper-heuristic, Nearest neighbor search, Semidefinite programming, Least absolute deviations, Robust optimization, Starmad, Klee-Minty cube, Wald's maximin model, Geometric median, Maxima and minima, Compressed sensing, Google matrix, Linear complementarity problem, Trajectory optimization, Quasiconvex function, Differential evolution, Multi-objective optimization, Wing shape optimization, Convex optimization, Jeep problem, Response surface methodology, Backward induction, Dead-end elimination, Karush-Kuhn-Tucker conditions, Energy minimization, Topology optimization, Subgradient method, Level set method, MPS, AMPL, Job shop scheduling, APMonitor, Nonlinear programming, Pontryagin's minimum principle, Odds algorithm, Dual problem, Meta-optimization, Linear-fractional programming, Goal programming, Variational Monte Carlo, Maximum theorem, Stress majorization, DNSS point, Farkas' lemma, Global optimization, Stochastic programming, Lloyd's algorithm, Paradiseo, Dantzig-Wolfe decomposition, Chebyshev center, Pseudoconvex function, Optimal stopping, Subderivative, Mathematical Programming Society, Pattern search, Lazy caterer's sequence, Second-order cone programming, Optimal substructure, Rosenbrock function, Newsvendor, Wolfe conditions, Database tuning, Complementarity theory, Trust region, UniSoma, Sum-of-squares optimization, Inventory control problem, Central composite design, Lagrange multipliers on Banach spaces, Paper bag problem, Stigler diet, Bilevel program, Lagrangian relaxation, Dual cone and polar cone, Robbins' problem, Line search, Job-shop problem, Matheuristics, Linear search problem, Walrasian auction, Danskin's theorem, Smoothed analysis, Algebraic modeling language, Reduced cost, Slack variable, RTCP hierarchical aggregation, Quadratically constrained quadratic program, Adaptive simulated annealing, Active set, Process optimization, Fenchel's duality theorem, Bayesian efficiency, Corner solution, Signomial, Infinite-dimensional optimization, Linear matrix inequality, Homicidal chauffeur problem, Conic optimization, Posynomial, Ternary search, Fritz John conditions, Guess value, Geometric programming, Backtracking line search, Moving least squares, Local optimum, Hardness of approximation, Hilbert basis, Successive linear programming, Lemke's algorithm, Special ordered set, 3-opt, Basis pursuit denoising, Multiprocessor scheduling, Pseudo-Boolean function, Cake number, Mixed complementarity problem, Topological derivative, Descent direction, Convex analysis, Demand optimization, Relaxation technique, Sion's minimax theorem, Bregman method, Steiner's problem, Global optimum, Discrete optimization, Rastrigin function, Single machine scheduling, Combinatorial data analysis, Mathematics of Operations Research, Candidate solution, Entropy maximization, Nonlinear complementarity problem, Extended Newsvendor models, Barrier function, Binary constraint, Benders' decomposition, ...