MGOC10H3 Lecture Notes - Nonlinear Programming, Integer Programming, Production Planning
Document Summary
Chapter 2 lp model formulation & solution. Example production planning: x1 = # of soldiers to make each week x2 = # of trains to make each week, objective is to maximize profits. 1x1 + 1x2 80 constraint 3 at most 40 soldiers can be sold x1 < 40: cannot produce negative # of soldiers/trains so x1,x2 > 0. 1x1 + 1x2 0 x1 < 40 x1, x2 > 0 (finishing) (carpentry) (soldier demand) For every gallon a produced at least 3 gallons of b must be produced. A, b 0 (production regular) (custom order) (processing) (production required) Z = 50000c + 100000f z = 50c + 100f. C, f > 0 (at least 28 million w) (at least 24 million m) Max z = 0. 06b + 0. 1s + 0. 02m. B 0. 3 or b 0. 3 (b + s + m)
