ExampleModeling.jl

Documentation for ExampleModeling.jl

Formulation

We formulate the canonical mixed-integer linear program as follows:

\[\begin{aligned} \text{maximize }& ๐š๐ฑ + ๐›๐ฒ \\ \text{subject to } & ๐€ ๐ฑ + ๐ ๐ฒ โ‰ค ๐œ \\ & ๐ฑ,๐ฒ โ‰ฅ 0 \\ & ๐ฒ โˆˆ โ„ค. \end{aligned}\]

We refer to the formulation as model. The model takes as inputs the indices and parameters.

Indices:

  • $m,n,kโˆˆโ„ค$

Parameters:

  • $๐šโˆˆโ„^{n}$
  • $๐›โˆˆโ„^{k}$
  • $๐œโˆˆโ„^{m}$
  • $๐€โˆˆโ„^{mร—n}$
  • $๐โˆˆโ„^{mร—k}$

The model outputs the variables and objectives.

Variables:

  • $๐ฑโˆˆโ„^{n}$
  • $๐ฒโˆˆโ„ค^{k}$

Objectives:

  • $f(๐ฑ,๐ฒ)= ๐š๐ฑ + ๐›๐ฒ$

You can read more about the theory of integer programming from [1].

References

  • 1Wolsey, L. A. (1998). Integer programming. Wiley.