What point in the feasible region maximizes the objective function?

constraints:

x ≥ 0

y ≥ 0

− x + 3 ≥ y

y ≤ 1/3 x + 1

objective function: c =5x-4y

(3,0)

Step-by-step explanation:

Observe the image. The feasible region ( shaded region) is the intersection of the inequalities of the problem.

For find an optimal solution we think as follow. We consider the set of all points whose objective function is equal to z. This is the doted purple line in the image. Observe that this line is perpendicular to the vector (blue vector) and note that increasing z correspond to moving the line in direction of the vector c. Since we need increase the value of the objective function, we would like to move the line as much as possible in the direction of the vector c without leave the feasible region.

Watching the image we observe that the best we can do is z=15, and the line pass by the vertex of the feasible region (3,0).

Then the point (3,0) maximizes the objective function.

x = 17

step-by-step explanation:

in the given figure, two triangles are inscribed in a circle where ∠bae ≅ ∠dae which makes the side be and de equal so we can write it as:

3x - 24 = x + 10

solving this equation for x to get:

3x - x = 10 + 24

2x = 34

x = 34/2

x = 17

therefore, the value of x = 17.

how am i supposed to answer

step-by-step explanation: