This talk will describe the problem which arises in feed mills of producing minimum cost diets when there are some discrete constraints on the diet formulas.
The Branch and Price method for the problem will be described and a comparison made of this with a standard Branch and Bound approach.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996