class 5

batches of produced be
C A chairs delusion should always very
T 11 11 11 a tables nose

formulating a linear program solution then interpretation

course relevant
1 identify the opportunity for optimization X

2 formulate an appropriate model done in Dms

dove on conjunction 9 can be done back forth
3
gather relevant data X

4 save the model I

5 finetune the solution senstruity analysis post optimality analysis

6 make a recommendation for implementation X

7 feedback X
we will use
only 3 logical operators I 7 9
Max 2 5C tbt objective function

2C t 3t I 60 wood label of constraint in linear programming

act t t Yo time 11

C Z O Constraints

T z o linear probl

non negating constraints can be written as x o

y
or All X 30

Prototype problem

Man 2 3 1 5 2

X E 9 Plante
2 2 I 12 Plant 2 A constant is a mathematical
expression that disallows some
3 1 t 2 2 I 18 Plantz possible values for a variable

X1 30 A feasible solution is called

optimal if and only if there is not
X2 30 a better feasible solution

A set of values for a variable is

a solution
Ni X2

A 010 feasible
B 1211
g 618
D C 2 only D is not a solution
E C 3,4

solution

feasible infeasible

not violating constraints violating constraints

optimal notoptimal

unique multipleoptimal

order solution
of reaching a

solution or not I
feasible or not I
optimal or not
two classifications of a constraint

constraint

non redundant redundant

X E 4
X2 E G

K AHHHH i

4 red 6
Hence XL 6 redundant

degenerate solution