Series:

i$.$ jinN: Refers to location

Parameters

Cij: Cost of transporting $1$ ton of product from location i to location $j$

Capi: Capacity of location $j$

Decision variables

$x_i{k}_j{?}_{?}$ : Product of type $k$ transported from location $i$ to location $j$ in $1$ ton.

DATA :

$k_{{?}_{?}}=(1,2,3)$

$C=[10,20,30,40,50]$

Cap $j=20$

$J=[a,b,c,d,e,fg,h,i,k]$

$i=$ company

Cap $j=20$

GOAL : MINIMIZE TO DECiSION VARIABLES

Can you solve its constraint Programing and Mathematical Programing model for IBM cplex code?