dietobj - p var Buy {j in FOOD} >= f_min[j], <=...

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

View Full Document Right Arrow Icon
set MINREQ; # nutrients with minimum requirements set MAXREQ; # nutrients with maximum requirements s set NUTR := MINREQ union MAXREQ; # nutrients set FOOD; # foods set STORE; # stores s param cost {STORE,FOOD} > 0; param f_min {FOOD} >= 0; param f_max {j in FOOD} >= f_min[j]; p param n_min {MINREQ} >= 0; param n_max {MAXREQ} >= 0; p param amt {NUTR,FOOD} >= 0;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: p var Buy {j in FOOD} >= f_min[j], <= f_max[j]; v minimize total_cost {s in STORE}: sum {j in FOOD} cost[s,j] * Buy[j]; minimize total_number: sum {j in FOOD} Buy[j]; m subject to diet_min {i in MINREQ}: sum {j in FOOD} amt[i,j] * Buy[j] >= n_min[i]; subject to diet_max {i in MAXREQ}: sum {j in FOOD} amt[i,j] * Buy[j] <= n_max[i];...
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