integprogr1

integprogr1 - minimize Cost: sum{i in Warehouses, j in...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
# example from tutorial page 9; file is integprogr1.mod set Warehouses; set Customers; param cost{i in Warehouses, j in Customers}; param supply{i in Warehouses}; # supply at Warehouse i param demand{j in Customers}; # demand at customer j param fixed_charge{i in Warehouses}; # cost of opening warehouse i var amount{i in Warehouses, j in Customers}; var open{i in Warehouses} binary; # =1 if warehouse i is opened
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: minimize Cost: sum{i in Warehouses, j in Customers} cost[i,j]*amount[i,j] +sum{i in Warehouses} fixed_charge[i]*open[i]; subject to Supply{i in Warehouses}: sum{j in Customers} amount[i,j] <= supply[i]*open[i]; # changed to <= subject to Demand{j in Customers}: sum{i in Warehouses} amount[i,j]=demand[j]; subject to positive{i in Warehouses, j in Customers}: amount[i,j] >= 0;...
View Full Document

This note was uploaded on 04/01/2011 for the course CO 370 taught by Professor Henry during the Winter '11 term at Waterloo.

Ask a homework question - tutors are online