0
When a feasible region is bounded on all sides where will the maximum and minimum values of the objective function occur?
Wiki User
∙ 11y ago
Surely, you should check the value of the function at the boundaries of the region first. Rest depends on what the function is.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
What is the maximum value of 3x 4y in the feasible region?
240
What is the maximum value of 4x 3y in the feasible region?
26
What is the maximum value of 5x plus 2y in the feasible region?
42
What is the maximum value of 2x plus 2y in the feasible region?
14
What are the minimum and maximum values for the objective function C equals 3x plus y?
The answer will depend on the ranges for x and y. If the ranges are not restricted, then C can have any value.
What is optimal feasible solution?
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.
What is optimal solution?
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.
What is the maximum value of 3x + 3y in the feasible region?
To find the maximum value of 3x + 3y in the feasible region, you will need to determine the constraints on the variables x and y and then use those constraints to define the feasible region. You can then use linear programming techniques to find the maximum value of 3x + 3y within that feasible region. One common way to solve this problem is to use the simplex algorithm, which involves constructing a tableau and iteratively improving a feasible solution until an optimal solution is found. Alternatively, you can use graphical methods to find the maximum value of 3x + 3y by graphing the feasible region and the objective function 3x + 3y and finding the point where the objective function is maximized. It is also possible to use other optimization techniques, such as the gradient descent algorithm, to find the maximum value of 3x + 3y within the feasible region. Without more information about the constraints on x and y and the specific optimization technique you wish to use, it is not possible to provide a more specific solution to this problem.
What is the maximum value of 3x plus 3y in the feasible region?
It would depend on the feasible region.
What is the maximum value of 6x plus 10y in the feasible region?
maximum value of 6y+10y
What is the maximum value of 3x 4y in the feasible region?
240
What is the maximum value of 4x 3y in the feasible region?
26
What is the maximum value of 5x plus 2y in the feasible region?
42
How many asymptotes can a bounded function have?
I believe the maximum would be two - one when the independent variable tends toward minus infinity, and one when it tends toward plus infinity. Unbounded functions can have lots of asymptotes; for example the periodic tangent function.
What is the maximum value of 6x plus 5y in the feasible region?
(6x)(5y)
What is the maximum value of 2x plus 2y in the feasible region?
14
What are the minimum and maximum values for the objective function C equals 3x plus y?
The answer will depend on the ranges for x and y. If the ranges are not restricted, then C can have any value.
