Question

How do you find the maximum and minimum values of the function subject to the given constraints: `x+y>=2, 7x-y<=14, 3y<=5x+6, f(x,y)=4x+7y`?

Answer 1

See below.

Explanation:

How do you find the maximum and minimum values of the function subject to the given constraints: `x+y>=2, 7x-y<=14, 3y<=5x+6, f(x,y)=4x+7y`?

This is a typical linear programming problem. It can be assembled as

`min//max f(X) = << c, X >>` subject to `A X ge b`

Here `c = (4,7)`

`A = ((1,1),(-7,1),(-3,5))`

`b = ((2),(-14),(-6))` and `X =(x,y)`

This example was worked out with the Lagrange Multipliers technique. The attached plot shows the feasible region with the main points shown at the frontier. The black vectors show the gradient direction at the stationary points and the red vectors show the restrictions gradient at those points. The maximum point is located at `3,7` with `f(3,7)=61` The minimum point is located at `2,0` with `f(2,0)=8`

So defining `s^2 = (s_1^2,s_2^2,s_3^2)` as slack variables we transform the inequality restrictions into equality

`AX = b - s^2`

Now calling `lambda = (lambda_1,lambda_2,lambda_3)` we can form the so called lagrangian

`L(x,s,lambda)= << c, x >> + << lambda, Ax-b+s^2 >>`

Their stationary points are determined by solving

`grad L = vec 0`

for `x,s,lambda` or

`{(c+lambda A=0),(Ax-b+s^2=0),(lambda s = 0):}`

so we obtain

#(( x = 2, y = 0, s_1 = 0, s_2 = 0, s_3 = -4, lambda_1 = -6.625, lambda_2 = 0.375, lambda_3 = 0), (x = 0, y = 2, s_1 = 0, s_2 = -4, s_3 = 0, lambda_1 = -5.875, lambda_2 = 0, lambda_3 = -0.375), (x = 3, y = 7, s_1 = -2.82843, s_2 = 0, s_3 = 0, lambda_1 = 0, lambda_2 = -2.9375, lambda_3 = -3.3125))#