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.

since the airplane is moving with constant speed then the distance travelled can be calculated by x=u*t

in km/h would be:

x=640*3.5=2.240 km

in m/s would be:

u=640 km/h= 640.000 m/h =640.000/ 3600 m/s =177.8 m/s

t= 3.5 h= 3.5 * 3600 s=12.600 s

then x=u*t= 177.8*12.600= 2.240.280 m

step-by-step explanation: noo