All Pages

From Glossary

See All

100% Rule		ABS algorithm		AIMMS
AMPL		ANALYZE		Abstract program
Active constraint		Active set method		Activity analysis
Acyclic		Adjacency matrix		Adjacent basis
Adjoint		Admissible		Advanced basis
Affine combination		Affine function		Affine hull
Affine independence		Affine scaling		Affine set
Aggregation		Algorithm		Alldifferent constraint
Almost complementary		Alternative systems		Analytic center
Ant colony optimization		Anticycling rule		Approximation algorithm
Arborescent sets		Arc consistency		Argmax
Argmin		Artificial variable		Assembly line balancing problem
Assignment polytope		Assignment problem		Asymptotic LP
Asymptotic stability		Atleast constraint		Atmost1 constraint
Atmost constraint		Auction algorithm		Augmented Lagrangian
Augmenting path		Automatic differentiation		BFGS method
BFGS update		BFS		Backbone
Backjumping		Backtracking		Backward Transformation
Backward substitution		Backward triangularization		Balance equation
Barrier function		Barycenter		Basic
Basic solution		Benders decomposition		Biconcave function
Biconvex function		Biconvex program		Bidding algorithm
Big-M method		Bilevel program		Bilinear function
Bilinear program		Bin packing problem		Binary CSP
Binary constraint		Binary relation		Binary variable
Binding constraint		Bisection		Bland rule
Blending problem		Block pivot		Blocking polyhedron
Bolzano-Weierstrass theorem		Bordered hessian		Bottleneck TSP problem
Bottleneck assignment problem		Bottleneck transportation problem		Bounds consistency
Box constraint		Braess paradox		Branch and bound
Branch and cut		Branch and price		Branching heuristic
Branching rule		Breakpoint		Broyden-Fletcher-Goldfarb-Shanno method
Broyden-Fletcher-Goldfarb-Shanno update		Broyden family		Bundle method
CPLEX		CSP		Calculus of variations
Capacity expansion		Capital budgeting problem		Caratheodory conditions
Caterer problem		Cauchy-Schwarz inequality		Ceiling
Central path		Certainty equivalent		Certificate
Chance constraint		Character of solution		Characteristic cone
Chemical equilibrium problem		Chinese postman problem		Chinese remainder theorem
Cholesky factorization		Chvatal cut		Chvatal function
Closed form solution		Closed function		Closed map
Closed set		Closure condition		Coercive function
Column generation		Combinatorial program		Compact formulation
Compact set		Compatibility theory		Complementarity condition
Complementarity problem		Complementary slackness		Complementary variables
Complexity		Complicating variables		Component
Composite concave program		Composite function		Concave function
Condition number		Cone		Cone of optimality
Conic program		Conjugate directions		Conjugate duality
Conjugate function		Conjugate gradient method		Conjugate vectors
Conjunctive normal form		Connected network		Consistency
Consistent		Constraint		Constraint graph
Constraint optimization problem		Constraint programming		Constraint propagation
Constraint propagator		Constraint qualification		Constraint satisfaction problem
Constraint solver		Continuous program		Contour
Contraction map		Convergence		Convex combination
Convex cost flow problem		Convex function		Convex hull
Convex program		Convex set		Convex simplex method
Convexity cut		Corner polyhedron problem		Correlation matrix
Cost of captial		Covering problem		Cramer rule
Crash		Criss-cross method		Critical path
Critical point		Crossover operation		Cumulative constraint
Cut search		Cutset		Cutting plane
Cutting stock problem		Cyclic descent		Cycling
DFP method		DFP update		Damped Newton method
Dantzig-Wolfe decomposition		Dead end elimination		Decision variable
Decomposition principle		Decoupling principle		Degeneracy
Degeneracy graph		Degenerate polyhedron		Degree-2 inequality
Degree of difficulty		Density		Detached coefficient form
Dichotomous search		Diet problem		Digraph
Dijkstra algorithm		Dimension		Diophantine equations
Directed tree search		Directional arc consistency		Directional derivative
Discount rate		Discrete program		Disjunctive constraint
Disjunctive normal form		Disjunctive program		Divide and conquer
Domain		Dominance		Doubly stochastic matrix
Dual		Dual degeneracy		Dual method
Dual norm		Dual price		Duality
Duality gap		Duality theorems		Dynamic CSP
Dynamic program		Economic order quantity		Edge-finding
Effective domain		Efficient frontier		Eigenvalue
Elastic program		Element constraint		Elementary matrix
Elementary simplex method		Elementary vector		Ellipsoid
Ellipsoid method		Elliptope		Epigraph
Equilibrium basis		Equivalent CSPs		Euclidean norm
Euler-Lagrange equation		Evolutionary algorithm		Exact penalty function
Existence of solution		Expanding subspace theorem		Explicitly quasiconcave function
Explicitly quasiconvex function		Exponent matrix		Extended reals
Extensional constraint		Exterior penalty function		Extrapolation
Extreme point		Extreme ray		Extreme value
FTRAN		Face		Facet
Facet-defining inequality		Facility location problem		Factorable function
Factorable program		Factored form of basis		Fail first principle
Faithfully convex		Fallacy of averages		Farkas lemma
Fathom		Feasibility map		Feasible
Feasible direction		Fermat-Weber problem		Fibonacci search
Fibonacci sequence		Fill-in		First-order conditions
Fixed charge		Fixed point		Fixed variable
Fleet mix problem		Floor		Flow augmenting path
Forced equality		Forcing substructure		Forward checking
Forward substitution		Forward transformation		Forward triangularization
Fourier-Motzkin elimination		Fractional program		Frank-Wolfe Theorem
Free variable		Fritz John conditions		Fuzzy CSP
Fuzzy math program		Fuzzy set		GAC
GAMS		GRASP		Game theory
Gauge function		Gauss-Jordan elimination		Gauss-Seidel method
Gaussian elimination		Generalized Lagrange multiplier method		Generalized arc consistency
Generalized equation		Generalized inverse		Generalized network
Generalized reduced gradient method		Generalized upper bound		Genetic algorithm
Geometric convergence		Geometric mean		Geometric program
Global Cardinality constraint		Global constraint		Global convergence
Global optimization		Global optimum		Glovers linearization
Goal program		Golden mean		Golden section search
Gomory cut		Gomory function		Gomory group
Gradient		Gradient projection method		Graph
Greedy algorithm		Groebner basis		Group problem
Haar condition		Hadamard inequality		Half-line
Halfspace		Hard constraint		Hausdorff metric
Hessenberg matrix		Hessian		Heuristic
Heuristic function		Heuristic search		Hirsch conjecture
Holder inequality		Homogeneous function		Homotopy
Hungarian method		Hypergraph		Hyperplane
Hypograph		Implicit enumeration		Implicit function theorem
Implied constraint		Implied equality		Inactive constraint
Incidence matrix		Inconsistent		Incumbent solution
Independent set		Indicator function		Inequality
Inequality of degree k		Infeasible		Inference dual
Infimum		Infinite program		Inner approximation
Integer equivalent aggregation		Integer polyhedron		Integer program
Integer rounding		Interior penalty function		Interior point method
Interior solution		Interpolation		Intersection cut
Inventory balance equation		Inventory control problem		Inverse problem
Involutionary property		Irreducible infeasible subsystem		Irredundant
Isoperimetric problem		Isoquant		Isotonic function
Jacobian		Jamming		Jensen inequality
Jeroslow formula		Job scheduling/sequencing		K-consistency
K-opt		Kantorovich inequality		Karmarkar algorithm
Kernel of basis		Klee-Minty polytope		Knapsack problem
Kuhn-Tucker conditions		Kuhn-Tucker point		LINDO
LINGO		LPL		LU decomposition
Label correcting algorithm		Label setting algorithm		Labeling algorithm
Lagrange conditions		Lagrange multiplier		Lagrange multiplier rule
Lagrange multiplier theorem		Lagrangian		Lagrangian duality
Lagrangian relaxation		Lagrangian saddlepoint equivalence		Lattice
Lattice program		Lattice search		Level set
Levenberg Marquardt algorithm		Lexicographic Ordering constraint		Lexicographic order
Lifting		Line search		Line segment
Linear combination		Linear convergence		Linear program
Linearity interval		Linearization		Lipschitz continuous
Local convergence		Local optimum		Locally convex function
Location problem		Lockbox problem		Logical variable
Lot size problem		Lower semi-continuity		Lower triangular matrix
MAX CSP		MIMI		MINOS
MODLER		MOSEK		MPL
Main Page		Manpower planning problem		Marginal price
Markov decision process		Matching problem		Mathematical program
Matrix norm		Matroid		MaxMin
Max flow-min cut theorem		Max flow problem		Maximal
Maximand		Maximum		Maximum principle
Maxmin		Memetic algorithm		Metaheuristic
Method of centers		Metric		Min-conflicts heuristic
Minimal		Minimal inequality		Minimand
Minimax		Minimax theorem		Minimum
Minkowski inequality		Mixed-integer program		Modified Newton method
Monoid		Monotonic function		Monte Carlo optimization
Moore-Penrose inverse		More for less paradox		Mosel
Multi-commodity flow		Multi-stage decision process		Multilevel program
Multiple objectives		Mutation operation		Myopic optimization
N-Opt		NP-complete		NP-hard
Near optimal		Nearest neighbor algorithm		Negative definite matrix
Negative semi-definite matrix		Neighborhood		Nelder-Mead simplex method
Network		Network flows		Neural network
New term		Newsboy problem		Newton method
No-free-lunch theorem		No-good		Node consistency
Node packing problem		Nonbasic		Nondegeneracy
Nonlinear program		Norm		Normal cone
Northwest corner rule		Null space		Numeric CSP
Objective function		Online problem		Optimal
Optimal partition		Optimal response function		Optimality gap
Optimality region		Optimization Software Library		Optimum
Order of convergence		Orthogonal complement		Orthogonal matrix
Orthogonal vectors		Out-of-kilter algorithm		Outer approximation
Over-constrained problem		Over-optimize		P-matrix
Packing problem		Parallel algorithm		Parallel tangents
Parameter		Parametric analysis		Parametric programming
Pareto optimum		Partial conjugate gradient method		Partial quasi-Newton method
Partial solution		Partially ordered set		Particle Swarm Optimization
Partitioning problem		Path		Path consistency
Path following		Pattern search		Penalty function
Perturbation		Phase I and Phase II		Pivot
Pivot selection		Point-to-set map		Pointed cone
Polar cone		Policy iteration		Polyhedral annexation
Polyhedral annexation problem		Polyhedron		Polymatroid
Polytope		Pooling of inventory		Pooling problem
Portfolio selection problem		Positive definite matrix		Positive semi-definite matrix
Postman problem		Posynomial		Pre-processing
Precedence constraint		Preconditioning		Predictor-corrector algorithm
Presolve		Pricing		Primal degeneracy
Primal method		Primal program		Prime representation
Principle of optimality		Problems		Product form of basis
Product mix problem		Production scheduling problem		Projected gradient method
Propagation		Proper optimum		Pseudo-boolean function
Pseudo-boolean program		Pseudo-inverse		Pseudo-monotone function
Pseudoconcave function		Pseudoconvex function		Pseudocost
Quadratic assignment problem		Quadratic form		Quadratic program
Quasi-Newton method		Quasiconcave function		Quasiconvex function
Quasimonotonic function		Randomized program		Range constraint
Range of compatibility		Rank-one correction		Rank-two correction
Rate of convergence		Rates of substitution		Ray
Recession cone		Recession direction		Recourse model
Reduce		Reduced cost		Reduced gradient method
Redundant constraint		Refinery problems		Reformulation
Reformulation-linearization technique		Regular constraint		Regular point
Reified constraint		Relative interior		Relaxation
Reoptimization		Reproduction operation		Requirements space
Residuals		Response space		Restricted basis entry rule
Reverse convex constraint		Reverse convex program		Right-hand side
Rim data		Robust optimization		Rosen decomposition
Rosenbrock function		Routing problems		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		TNP rule		TSP
Table constraint		Tableau		Tabu search
Tangent cone		Tangent plane		Target analysis
Taylor expansion		Taylor series		Taylor theorem
Temporal CSP		Theorem of alternative		Tight constraint
Time staged		Tolerance approach		Tolerances
Topological sort		Totally unimodular matrix		Transportation problem
Transposition theorem		Transshipment problem		Traveling salesman problem
Triangle inequality		Triangular matrix		Trim problem
Truncated gradient		Trust region method		Unbounded math program
Unconstrained math program		Unconstrained optimization		Unimodal function
Unimodular matrix		Unitary matrix		Univariate optimization
Upper semi-continuity		Upper triangular matrix		Utility function
Valid inequality		Value iteration		Value ordering heuristic
Variable metric method		Variable ordering heuristic		Variable upper bound
Variational calculus		Variational inequality		Vector space
Vehicle routing problem		Vertex		Vertex cover
Vertex enumeration		Warehouse problem		Weak duality
Weber problem		Weierstrass theorem		Weighted CSP
Well posed		Working set		XPRESS-MP
Zigzag phenomenon