Use the method of steepest ascent to approximate the optimal
solution to the following problem: max...
Use the method of steepest ascent to approximate the optimal
solution to the following problem: max z=-(x1-2)^2-x1-(x2)^2 .
Begin at the point(2.5,1.5)
(p.s. The answer already exists on the Chegg.Study website is
incorrect)
Use the graphical method for linear programming to find the
optimal solution for the following problem.
Maximize P = 4x + 5 y
subject to 2x + 4y ≤ 12
5x + 2y ≤ 10
and x ≥ 0, y ≥
0.
graph the feasible region
For the following LP problem, determine the optimal solution by
the graphical solution method.
Min Z= 3x1+2x2
Subject to 2x1+x2 >10
-3x1+2x2
< 6
X1+x2
> 6
X1,x1
> 0
Graph and shade the feasible region
For the following linear programming problem, determine the optimal
solution by the graphical solution method
Max
-x + 2y
s.t.
6x - 2y <= 3
-2x + 3y <= 6
x + y <= 3
x, y
>= 0
Compute, by Euler’s method, an approximate solution to the
following initial value problem for h = 1/8 : y’ = t − y , y(0) = 2
; y(t) = 3e^(−t) + t − 1 . Find the maximum error over [0, 1]
interval.
Problem Four
Use Runge Kutta method of order four to approximate the solution
of the initial value problem
?′ + 2? = ??3?, 0 ≤ ? ≤ 1, ?(0) = 0, ???ℎ ℎ = 0.5
Hint: Compute ?(0.5) ??? ?(1)
Use power series approximations method to approximate the
solution of the initial value problem: y"− (1+ x) y = 0 y(0) = 1
y'(0) = 2 (Write all the terms up to the power ). x^4
Use eulers Method with step size h=.01 to approximate the
solution to the initial value problem y'=2x-y^2, y(6)=0 at the
points x=6.1, 6.2, 6.3, 6.4, 6.5