Mixed-Integer linear programming

From Optimization for Chemical Engineering: 4G3
Revision as of 19:50, 25 March 2015 by Kevin Dunn (talk | contribs) (Created page with "__NOTOC__ {{ClassSidebar | date = 25 March 2015 | dates_alt_text = | vimeoID1 = 123236313 | vimeoID2 = | vimeoID3 = | vimeoID4 = | vimeoID5 = | vimeoID6 = | vimeoID7 = | vim...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Class date(s): 25 March 2015
Download video: Link [787 M]

Resources

Scroll down, if necessary, to see the resources.

Date Class number Topic Slides/handouts for class Video file References and Notes
25 February 11B
  • Representation of integer variables
  • Types of problems that can be solved with integer variables

Handout from class

Video


Solving a basic ILP

free variable        income    "total income";
positive variables   x1, x2;
binary variable      delta     "use ingredient x3 or not at all";

EQUATIONS
obj    "maximize income",
blend  "blending constraint";
obj..   income =E= 18*x1 - 3*x2 - 9*(20*delta);
blend.. 2*x1 + x2 + 7*(20*delta) =L= 150;
x1.up = 25;
x2.up = 30;

model recipe /all/;
SOLVE recipe using MIP maximizing income;