All Pages

From Glossary

See All

Saddlepoint		Satisfiability problem		Scaling
Scatter search		Scheduling		Scope
Search		Search tree		Secant method
Second-order conditions		Self concordance		Semi-assignment problem
Semi-definite program		Semi-infinite program		Sensitivity analysis
Separable program		Separating hyperplane		Sequencing problems
Sequential decision process		Sequential linear programming		Sequential quadratic programming
Sequential unconstrained minimization technique		Set constraint		Set covering problem
Set variable		Shadow price		Sherman-Morrison formula
Shortest path		Signomial		Simplex
Simplex method		Simplex multiplier		Simplicial subdivision
Simulated annealing		Skew symmetric matrix		Slack variable
Slater condition		Smooth		Soft constraint
Spanning tree		Sparsity		Specially ordered set
Spectral radius		Spectrum		Speed of convergence
Stability region		Stable math program		Stable set
Standard linearization		Stationary point		Stationary policy
Steel beam assortment problem		Steepest ascent		Steiner problem
Step size		Stochastic matrix		Stochastic program
Strict interior		Strict optimum		Strictly complementary
Strictly concave function		Strictly convex function		Strictly quasiconcave function
Strictly quasiconvex function		Strong duality		Strongly concave function
Strongly convex function		Strongly quasiconcave function		Strongly quasiconvex function
Structural variable		Subadditive function		Subdifferential
Subgradient		Sublinear rate of convergence		Submodular function
Subspace		Substitution		Successive approximation
Sufficient matrix		Super sparsity		Superadditive function
Superbasic variable		Superconsistent		Superlinear rate of convergence
Supermodular function		Support set		Supporting hyperplane
Supremum		Surplus variable		Surrogate constraint
Surrogate dual		Surrogate relaxation		Symbolic CSP
Symmetric dual		Symmetry exclusion