GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
</font>Adapted from:
Daskin, M. S. 1995. Network and Discrete Location: Models, Algorithms, and Applications. Hoboken, NJ, USA: John Wiley & Sons, Inc.
1. Canonical Form
Minimize
$\sum_{j}$ cjYj
Subject to
$∑_{j}$ aijYj ≥ bi ∀ i
Yj ≥ 0 ∀ j
where
− i = a specific origin in a matrix
− j = a specific destination in a matrix
− cj = user-defined constants
− bi = user-defined constants
− aij = user-defined constants
− Yj = primal decision variables
2. Standard Form
Minimize
$\sum_{j}$ cjYj
Subject to
$∑_{j}$ aijYj - Si ≥ bi ∀ i
Yj ≥ 0 ∀ j
Si ≥ 0 ∀ i
where
− i = a specific origin in a matrix
− j = a specific destination in a matrix
− cj = user-defined constants
− bi = user-defined constants
− aij = user-defined constants
− Yj = primal decision variables
− Si = surplus variables
In [ ]: