Minimize the objective function P = 45x + 48y for the given constraints. X20

y 20

5x + y = 16

x + 3y 26

Following are the solution to the given equation:

Step-by-step explanation:

The graph file and correct question are defined in the attachment please find it.

According to the linear programming principle, we predict, that towards the intersections of the constraint points in the viability area, and its optimal solution exists.  The sketch shows the points that are (0,16), (3,1), and (6,0).

by putting each point value into the objective function:

Thus, the objective of the function is reduced with a value of 183 at (3,1).

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for