Category
page 1Linear programming
linear programming
programming method to achieve the best outcome in a mathematical model
simplex algorithm
algorithm
set cover problem
classical problem in combinatorics
linear inequality
inequality which involves a linear function
duality
term in mathematical optimization theory
data envelopment analysis
nonparametric method in operations research and econometrics
Farkas' lemma
theorem
semidefinite programming
subfield of convex optimization
Karmarkar's algorithm
linear programing method
assignment problem
combinatorial optimization problem
dual cone
concepts in convex analysis
duality gap
Gurobi
optimization solver
ellipsoid method
iterative method for minimizing convex functions
linear programming relaxation
linear program that arises by removing the integrality constraints in an integer program
dual linear program
a linear program derived by inverting constraints and variables
weak duality
Concept in optimization
slack variable
mathematical concept
strong duality
condition in mathematical optimization
big M method
method of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants
Hirsch conjecture
on lengths of shortest paths in convex polytopes
Benders' decomposition
mathematical programming technique