Flashcards in Lecture 5 OPtimisation Deck (11):

1

## types of optimisation

###
linear programmng

dynamic programming

stochastic methods

simulation methods

2

## steps

###
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

3

## 4 characersitics of linear programming

###
proportionallity

additivity

devisibility

certainty

4

## 3 things for linear programming

###
decision variables

objective function

constraints

5

## types of solutions

###
no feasible solution

unbounded

optimal

corner point solution

6

## simplex algorithm 5 steps

###
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

7

## what are the basic variables

### s1 s2 s3 added to each constraint equation

8

## what are non basic variables

### x1 x2

9

## what is the entering and exiting variable

###
entering is one of the non basic x

exiting is one of the basic s

10

## how to choose entering

###
largest negative coefficient in fx

11