The maximum and the minimum values of 5x + 7y, when |x| + |y| ≤ 1 are
We are asked to find the maximum and minimum values of the expression \(5x + 7y\) subject to the constraint \(|x| + |y| \le 1\).
The constraint \(|x| + |y| \le 1\) defines a region in the xy-plane. This region is bounded by the lines where \(|x| + |y| = 1\).
Let's look at the boundary \(|x| + |y| = 1\) in each quadrant:
These lines form a diamond shape (a square rotated by 45 degrees) centered at the origin. The vertices of this region are the points where these lines intersect. These vertices are:
The region defined by \(|x| + |y| \le 1\) includes all points inside and on the boundary of this diamond shape.
The expression we want to find the maximum and minimum values for is \(5x + 7y\). This is a linear function of \(x\) and \(y\). For a linear function defined over a closed and bounded convex region (like our diamond shape), the maximum and minimum values occur at the vertices of the region.
Therefore, we need to evaluate the expression \(5x + 7y\) at each of the vertices:
The values of the expression at the vertices are 5, -5, 7, and -7.
Comparing the values obtained at the vertices:
So, the maximum value of \(5x + 7y\) is 7, and the minimum value is -7.
The maximum and minimum values are 7 and -7.
Consider the linear programming problem:
Maximize z = 3x + 4y
subject to x + y ≤ 12, 2x + 3y ≤ 30, x + 4y ≤ 36, x ≥ 0,y ≥ 0.
Then the optimal solution of the given problem is
| LIST-I (Name of Methods) | LIST-II (Problem Type) |
|---|---|
| A. Branch and bound method | I. Integer Programming Problem |
| B. The North-west corner rule | II. Quadratic Programming Problem |
| C. Lagrange Multiplier Method | III. Transportation Problem |
| D. Wolfe's Modified Method | IV. Non-Linear programming problem |