Mathematical IP model for problem solution. For the development of this .md file, this solution has been used: https://gist.github.com/a-rodin/fef3f543412d6e1ec5b6cf55bf197d7b

Parameters	Description
${UPC}_{ki}$	Unit production cost of product k at factory i
${TC}_{kij}$	Transportation cost of product k from factory i to market j
${SUC}_{ki}$	Set-up cost for the production of product k at factory i
${MaxOP}_{ki}$	Maximum Output production of product k at factory i
${MinOP}_{ki}$	Minimum Output production of product k at factory i
${CR}_{ki}$	Capacity required (in man-hours) for the production of product k at factory i
${TC}_i$	Total capacity (in man-hours) available at each factory i
$D_{kj}$	Demand for product k in market j

Decision variables	Description
$X_{kij}$	Positive integer variable, takes the value of the amount of products k produced at factory i and transferred to market j
$P_{ki}$	Binary variable, takes the value of 1 if product k is produced at factory i, or 0 otherwise

Cosntraints	Numbering
$\sum_{j\ =\ 1}^{3\ }X_{kij}\le\ {MaxOP}_{ki}\ast\ P_{ki},\ \forall\ k,i\in[1,\ 3]$	1
$\sum_{j\ =\ 1}^{3\ }X_{kij}\geq\ {MinOP}_{ki}\ast\ P_{ki},\ \forall\ k,i\in[1,\ 3]$	2
$\sum_{k\ =\ 1}^{3\ }\sum_{j\ =\ 1}^{3}{(X_{kij}\ast{CR}_{ki})}\geq\ {TC}_i,\ \forall\ i\in[1,\ 3]$	3
$\sum_{i\ =\ 1}^{3\ }X_{kij}\geq\ D_{kj},\ \forall\ k,j\in[1,\ 3]$	4
$\sum_{k\ =\ 1}^{\ 3\ }P_{ki}\le\ 2,\ \forall\ i\in[1,\ 3]$	5
$\sum_{i\ =\ 1}^{\ 3\ }P_{ki}\le\ 2,\ \forall\ k\in[1,\ 3]$	6

Objective function	Numbering
$MINIMIZE \ \sum_{k\ =\ 1}^{3}\sum_{i\ =\ 1}^{3}{\sum_{j\ =\ 1}^{3}{(X_{kij}\ast({UPC}_{ki}+{TC}_{kij}))}\ }+\sum_{k=1}^{3}\sum_{i=1}^{3}{P_{ki}\ast{SUC}_{ki}}$	7

Provide feedback

Saved searches