Linear Programming

Maximising and minimising in linear function.

Subjected system of linear constraints. The constraints maybe equalities or inequalities . linear function is called the objective function of the f(x,y)= aX+ bY = c

The profit or cost function to the maximise or minimise the objective function. The process of finding the optimal level with the system of linear inequalities is called Linear Programing .

Object function the objective of linear problem to be maximise or minimise.

Example:  

                                Maximise : c = x + y

                               

      

 (Craig, 2015)




video