MathComputational mathOptimizationLinear programming

Methods of solving LPP: a graphical method

Theory

Feasible region from intersecting hyperplanes

Report a typo

You have the following linear programming problem:

Maximize z=4x1+3x2Maximize \ z = 4x_1 + 3x_2Subject to the following constraints:

x1+x2≤602x1+x2≤803x1+x2≤120x1,x2≥0x_1 + x_2 \le 60 \\ 2x_1 + x_2 \le 80 \\ 3x_1 + x_2 \le 120 \\ x_1, x_2 \ge 0Select the hyperplanes that intersect to form the feasible region.

Select one or more options from the list
___

Create a free account to access the full topic