linear programming

Question 1

what is a non-basic variable

Answer 1

value of variable = 0,
if variable is not basic it is non-basic

Question 2

determining a basic variable

Answer 2

variable has value =/= 0
in tableau and its column has only one non-zero row

Question 3

what is the pivot

Answer 3

the value of the point in the table moved to,
row (number) column (variable) : value

Question 4

finding pivot

Answer 4

> the most negative coefficient in the top row,
increasing this variable has the most effect on P
then which constraint is met first–> lowest +ve

Question 5

simplex algo

Answer 5

1) find pivot
2) eliminate the variable from each row except pivot
3) evaluate tableau, if -ve in top row then optimum has not been met and repeat.

Question 6

when to use simplex

Answer 6

3 or more basic variables

Question 7

use of slack variables

Answer 7

to change inequalities to equalities

Question 8

minimising a function P

Answer 8

maximise Q such that Q=-P

Question 9

stopping condition for simplex

Answer 9

top row is all positive coeff

Question 10

objective line

Answer 10

line such that P= ax +by is satisfied
rearrange into y= then move up and down for diff P and to find max/ min soln

Question 11

tour of verticies

Answer 11

sub each vertex into the maximal/minimal function P to find optimum