0
What appears to be the maximum value of P equals 5x plus 6y for the feasible region in the graph?
Wiki User
∙ 11y ago
78
Wiki User
∙ 11y ago
Maryam Shahzad
78
Add your answer:
Earn +20 pts
What is the maximum value of 6x plus 5y in the feasible region?
(6x)(5y)
Why a feasible region is the unshaded region?
i know that a feasible region, is the region which satisfies all the constraints but i don't know exactly why is the unshaded region regarded as a feasible region instead of the shaded region.
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 the value of 6x 5y at point D in the feasible region?
Given definitions, or descriptions at least, of "point D" and "the feasible region",I might have had a shot at answering this one.
What is the minimum value of 4x 3y in the feasible region?
Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "equals", "squared", "cubed" etc.Furthermore, there is no information on what the feasible region is so, even if the browser worked perfectly, it would have been impossible to answer the question.Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "equals", "squared", "cubed" etc.Furthermore, there is no information on what the feasible region is so, even if the browser worked perfectly, it would have been impossible to answer the question.Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "equals", "squared", "cubed" etc.Furthermore, there is no information on what the feasible region is so, even if the browser worked perfectly, it would have been impossible to answer the question.Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "equals", "squared", "cubed" etc.Furthermore, there is no information on what the feasible region is so, even if the browser worked perfectly, it would have been impossible to answer the question.
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 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 6x plus 10y in the feasible region?
maximum value of 6y+10y
What is the maximum value of 5x plus 2y in the feasible region?
42
What is the maximum value of 2x plus 5y in the feasible region?
The answer obviously depends on what the boundaries of the feasibility region are.
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 is the definition of unbounded region?
definition feasible region definition feasible region
Why a feasible region is the unshaded region?
i know that a feasible region, is the region which satisfies all the constraints but i don't know exactly why is the unshaded region regarded as a feasible region instead of the shaded region.
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 point in the feasible region maximizes C for the objective function C equals 4x-2y?
1y
