Linear Programming Problems (LPP)


Ask a Question, Get an Answer!
Hundreds of tutors are online and ready to help you right now!
The standard form of the linear programming problem is used to develop the procedure for solving a general programming problem.

A general LPP is of the form

Max (or min) Z = c1x1 + c2x2 + … +cnxn

x1, x2, ....xn are called decision variable.

subject to the constraints

.

.

.

c1, c2,…. Cn, a11, a12,…. amn are all known constants

Z is called the "objective function" of the LPP of n variables which is to be maximized or minimized.



Ask a Question? Get an Answer!

connect to a tutor


Related Searches

"linear programming problems"

;,  

limitations of linear programming

,  

advantages of linear programming

,  

what is Linear Programming

,  

standard form

,  

method to solve LPP

,  

decision variables

,  
decision variable
,  
algebra problems
...more