To begin with, what follows is an example of an LP problem:

where s.t. stands for "subject to" the list of constraints. We observe that all decision variables occur in a linear fashion (no powers, no products, no fancy functions), and it is easy to see that the optimal solution is with optimal value of the objective function 

Transcribed Image Text:

max x1 + 2x2 s.t. x1+x24 x1, x20,