Home | 18.022 | Chapter 15 | Section 15.6

Tools    Index    Up    Previous    Next


You have the following equations and inequalities

x + y + z = 2, x-y1, x0, y0, z0

find the maximum value of x + 2z.

Notice that each of the constraints is either an equality or inequality and all are linear in the variables, as is the function to be maximized. This makes this a linear program.