It would depend on the feasible region.
Since there is no feasible region defined, there is no answer possible.
If we knew the values of 'x' and 'y', and the boundaries of the feasible region, we could answer that question quickly and easily.
To find the maximum value of 2x + 5y within the feasible region, you would need to evaluate the objective function at each corner point of the feasible region. The corner points are the vertices of the feasible region where the constraints intersect. Calculate the value of 2x + 5y at each corner point and identify the point where it is maximized. This point will give you the maximum value of 2x + 5y within the feasible region.
the feasible region is where two or more inequalities are shaded in the same place
It would depend on the feasible region.
Since there is no feasible region defined, there is no answer possible.
The answer depends on what the feasible region is and on what operator is between 6x and 8y.
26
The answer depends on the feasible region and there is no information on which to determine that.
Surely, you should check the value of the function at the boundaries of the region first. Rest depends on what the function is.
It is usually the answer in linear programming. The objective of linear programming is to find the optimum solution (maximum or minimum) of an objective function under a number of linear constraints. The constraints should generate a feasible region: a region in which all the constraints are satisfied. The optimal feasible solution is a solution that lies in this region and also optimises the obective function.
It is 18.
maximum value of 6y+10y
42
If we knew the values of 'x' and 'y', and the boundaries of the feasible region, we could answer that question quickly and easily.
2x+2y