Mathematical Sciences Classification System
90Cxx - Mathematical programming
[See also 49Mxx, 65Kxx]
-
90C05Linear programming
-
90C06Large-scale problems
-
90C08Special problems of linear programming (transportation, multi-index, etc.)
-
90C09Boolean programming
-
90C10Integer programming
-
90C11Mixed integer programming
-
90C15Stochastic programming
-
90C20Quadratic programming
-
90C22Semidefinite programming
-
90C25Convex programming
-
90C26Nonconvex programming, global optimization
-
90C27Combinatorial optimization
-
90C29Multi-objective and goal programming
-
90C30Nonlinear programming
-
90C31Sensitivity, stability, parametric optimization
-
90C32Fractional programming
-
90C33Complementarity and equilibrium problems and variational inequalities (finite dimensions)
-
90C34Semi-infinite programming
-
90C35Programming involving graphs or networks [See also 90C27]
-
90C39Dynamic programming [See also 49L20]
-
90C40Markov and semi-Markov decision processes
-
90C46Optimality conditions, duality [See also 49N15]
-
90C47Minimax problems [See also 49K35]
-
90C48Programming in abstract spaces
-
90C49Extreme-point and pivoting methods
-
90C51Interior-point methods
-
90C52Methods of reduced gradient type
-
90C53Methods of quasi-Newton type
-
90C55Methods of successive quadratic programming type
-
90C56Derivative-free methods and methods using generalized derivatives [See also 49J52]
-
90C57Polyhedral combinatorics, branch-and-bound, branch-and-cut
-
90C59Approximation methods and heuristics
-
90C60Abstract computational complexity for mathematical programming problems [See also 68Q25]
-
90C70Fuzzy programming
-
90C90Applications of mathematical programming
-
90C99None of the above, but in this section