L3 - Transportation Linear Programming

Question 1

How are transportation problems different to assignment problems?

Answer 1

• where are in a two variable transportation problem each variable is denoted as X{i,j}
• in assignment problems the variable X{i,j} can only be the value of 0 or 1 whereas the value in transportation problems can take any value

e.g.
X{i,j}=1 then machine i is completing job j
X{i,j} = 0 for anything else

Question 2

How do you write the non-negativity condition for assignment problems?

Answer 2

x{i,j}=0,1
which means
X{i,j} ≥ 0

for problems that are binary

Question 3

How do you handle Dynamic Transport Problems?

Answer 3

• Draw a table with the time frames and the table headings plotting your supply and production against each other