(algorithmic) consider the following linear program: min 2 a + 2 b
s. t.
a + 3 b ≤ 12
3 a + b ≥ 13
a - b = 3 a,
b ≥ 0 choose the correct graph that shows the feasible region.
what are the extreme points of the feasible region?
there are two extreme points: and
find the optimal solution.
the optimal solution is a = , b =

the equation cos(35) =a/25 can be used to find the length of bc what is the length of bc? round to the nearest tenth

step-by-step explanation:

the answer is:

the correct option:

b.

to solve the problem, we need to remember how to operate to simplify exponential expressions using the logarithms.

we are given the equation:

then, using placing logarith with base 7 on both sides of the equation, we have:

so, rounding the obtained result to two decimal places (nearest hundreth), we have:

hence, we have that the correct option:

b.

have a nice day!

isaiah walks 3 miles due north, turns and then 5 miles due east. how far is he from his starting point?

a^2 + b^2 = c^2

let c = distance from starting point.

(3)^2 + (5)^2 = c^2

9 + 25 = c^2

34 = c^2

sqrt{34} = sqrt{c^2}

sqrt{34} = c

2y+y=5

add 2y and y