Consider the following problem. Maximize Z= x1 + 2x2,

subject to

x1 =< 5
x^2 =< 6
x1 + x2 <= 8 and

x1>= 0, x2 >= 0

Required:
a. Plot the feasible region and circle all the CPF solutions.
b. For each CPF solution, identify the pair of constraint bound- ary equations that it satisfies.
c. For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of x1 and x2 at the corner point.
d. For each CPF solution, identify its adjacent CPF solutions.
e. For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation.

2 & 7

step-by-step explanation:

he climbs 300 ft/hr at a constant rate. the peak is at 1,500 ft.

when going up, he reaches 600 ft in 2 hours. remember, that he is going in a constant rate. divide 600 with 300:

600/300 = 2

assuming that he takes the same route back (meaning that it's a 1500 ft route back, you can solve.

note also that you are solving when he gets back to 600 ft after he reaches the peak.

first, find the amount of hours it takes to get up the peak. divide the total amount (1500), with the ft/her (300) to get the amount of hours (x):

1500/300 = x

x = 5

it takes jamie 5 hours to get up. now, he is returning down, and reaches 600 (his current destination). remember that he climbs at a constant 300 ft/hr. divide 600 with 300:

600/300 = x

x = 2

now add the two numbers together.

x = 5 + 2 = 7

jamie takes 7 hours to go up the mountain and reach his current position when descending.

(total amount/constant rate) = (time).

remember that it is a constant rate, so in total, when he gets back down the mountain, it will take the same amount of time as when he goes up. the total amount for the round trip is: 5 + 5 = 10.

~

i only know the sequence of arithmetic it adds the first is 5+4 then it goes up as it adds to then it is 9+5 then 14+6 then to 20+7 and so on. 5,9,14,20,27,35.

step-by-step explanation: