Given the following linear optimization problem
Maximize 10x + 20y
Subject to
x + y < 50
2x + 3y < 120
x > 10
x, y > 0
(a) Graph the constraints and determine the feasible region.
(b) Find the coordinates of each corner point of the feasible
region.
(c) Determine the optimal solution and optimal objective
function value.
Consider the following linear programming problem:
Maximize 16X + 14Y
Subject to: 3X + 4Y ≤ 520
3X + 2Y ≤ 320
all variable ≥ 0
The maximum possible value for the objective function is
Solve the following linear programming problem by the
graphical method.
Maximize Z = 400 X1 + 200 x 2
Subject to : X1 + 8X2 <= 24
X1 + 2X2 <= 12
X1 >= 0 , X2 >= 0
You will need to graph each of the constraints to answer
the following questions. You can draw a rough graph.
a) State the coordinates of the point where the
constraints interact.
b) Define in words the region of feasible
solutions.
c)...
Solve the initial value problem: y'' + 4y' + 4y = 0; y(0) = 1,
y'(0) = 0.
Solve without the Laplace Transform, first, and then with the
Laplace Transform.