Lecture 5 OPtimisation

Question 1

types of optimisation

Answer 1

linear programmng
dynamic programming
stochastic methods
simulation methods

Question 2

steps

Answer 2

1 define porblem in words
2 define in math
3 simplify to solvable form
4 solve simplified math
5 sensitivity analysis
6 interpretation of results
7 more analysis

Question 3

4 characersitics of linear programming

Answer 3

proportionallity
additivity
devisibility
certainty

Question 4

3 things for linear programming

Answer 4

decision variables
objective function
constraints

Question 5

types of solutions

Answer 5

no feasible solution
unbounded
optimal
corner point solution

Question 6

simplex algorithm 5 steps

Answer 6

1) convert problem into standard form
2) determine basic and non basic variables
3) obtain entering and leaving variable
4) determine the pivot equation
5) add and sub pivot equation form other rows to elminate entering variablke

Question 7

what are the basic variables

Answer 7

s1 s2 s3 added to each constraint equation

Question 8

what are non basic variables

Answer 8

x1 x2

Question 9

what is the entering and exiting variable

Answer 9

entering is one of the non basic x

exiting is one of the basic s

Question 10

how to choose entering

Answer 10

largest negative coefficient in fx

Question 11

pivot equation

Answer 11

one with smallest ratio of coefficient in front of non basic variable to the c