blog:main:mixed_integer_linear_programming

This is an old revision of the document!

# Mixed Integer Linear Programming

The term programming means planning and linear implies that all equations involved in a problem would be linear. The technique of linear programming first invented by the Russian Mathematician L. V. Kantorovich and developed later by George B. Dantzig. Linear Programming is a mechanism for mathematical modeling and optimizing decisions. NEOS Guide  provides an optimization taxonomy, see Figure, focused mainly on the subfields of deterministic optimization with a single objective function. Linear programming is, thus, deterministic, continuous and linearly constrained optimization. Mixed integer refers to the combination of integers and continuous decision variables. A linear programming problem is one in which some function is either maximized or minimized relative to a given set of alternatives. The function to be minimized or maximized is called the objective function and the set of alternatives is called the feasible region determined by a system of linear inequalities (constraints).

 “Morgridge Institute for Research and Wisconsin Institute for Discovery, NEOS Server, ”https://neos-guide.org/.

• blog/main/mixed_integer_linear_programming.1555862186.txt.gz