Consider the optimization problem of minimizing a function f(x) over a standard from polyhedron. When f(x) is linear, one method of solution is to employ the Primal Path Following Algorithm (discussed in class and in Section 9.4 of the textbook). Now, suppose f(x) is not linear, but is twice continuously differentiable. Can the same algorithm still be used to solve this new problem? Carefully discuss some possible outcome

No,due to continuously double differentiable,this algorithm will not solve this problem as function is linear.  

i leave the calculator work to you.

7. diameter 4 miles, circumference 4π miles

8. radius 0.2 miles, circumference 0.4π miles

[this is a bad problem because the actual radius of a car on the track is less than 0.2 miles so the answer is less than 0.4π miles]

9. radius 6 feet, circumference 12π feet

10. diameter 14 cm, circumference 14π cm

11. diameter 4.8 feet, circumference 4.8π feet

are you an artist's daughter? cuz dang you a fine piece of art, girl.