Linear Programming problem
Not what you're looking for?
Geometrically solve the following LP(Linear Programming):
min x1- 2x2
s.t. x1 - x2 >= -4
-3x1 - 2x2 >= -18
-3x1 + x2 >= -9
x1, x2 >= 0
Again geometrically solve for each of the LPs with the same feasible region as above but with respective objective functions -x1+2x2, and -3x1- x2, and 3x1+x2, and 3x1-3x2. (Five different LPs should be solved, but you can render a single plotting of the feasible region.)
Purchase this Solution
Solution Summary
Linear Programming problem is demonstrated.
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Probability Quiz
Some questions on probability
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.