02 Intro To Linear Programming
02 Intro To Linear Programming
Text: Chapters
2, 3, and 4
Outline
Basic concepts; Building LP models; Solver option in Excel; Examples; Interpreting the solutions.
6 large bricks
8 small bricks
LP assumptions
Linearity: the impact of decision variables is linear in constraints and objective function;
Divisibility: noninteger values of decision variables are acceptable;
Certainty: values of parameters are known and constant;
Nonnegativity: negative values of decision
variables are unacceptable.
Lego - LP model
Decision variables: unknown number of tables and unknown number of chairs
to build
Constraints: number of available blocks and the specications for construction
of a chair and a table.
Objective function: maximization of the earnings from use of Lego bricks.
LP model
Max $20x1 + $15x2
subject to (s.t.)
2x1 + x2 <= 6
use and availability of large bricks
2x1 + 2x2 <= 8
use and availability of small bricks
x1 >= 0; x2 >= 0
LP model development
Decision variables:
x1 - unknown amount (in kg) of NG100 in a bag
x2 - unknown amount (in kg) of NG250 in a bag
x3 - unknown amount (in kg) of NG350 in a bag
x4 - unknown amount (in kg) of NG500 in a bag
Objective function
min 0.04x1 + 0.05x2 + 0.06x3 + 0.08x4
Constraints
s.t.
x1 + x2 + x3 + x4 = 100
size of a bag
x1 + x2 <= 40
requirement for the amounts of NG100 and NG250 in a bag
x3 + x4 >= 50
requirement for the amounts of NG350 and NG500 in a bag
x4 >= 10
requirement for the amounts of NG500 in a bag
x1 >= 0; x2 >= 0; x3 >= 0; x4 >= 0