Linear Programming : Objective Function & Feasible Solution
Not what you're looking for?
Consider the following integer linear programming problem
Max Z = 3x1 + 2x2
Subject to: 3x1 + 5x2 30
4x1 + 2x2 28
x1 8
x1 ,x2 0 and integer
The solution to the Linear programming relaxation is:
x1 = 5.714, x2= 2.571.
What is the upper bound for the value of the objective function?
What is the value of the objective function for the rounded down solution?
Is the rounded down solution feasible?
Purchase this Solution
Solution Summary
The solution shows how to calculate the upper bound of the objective function and the value of the objective function.
Education
- BE, Bangalore University, India
- MS, University of Wisconsin-Madison
Recent Feedback
- "Your explanation to the answers were very helpful."
- "What does 1 and 0 means in the repair column?"
- "Went through all of the formulas, excellent work! This really helped me!"
- "try others as well please"
- "Thank you, this helped a lot. I was not sure how to plug in those numbers to a formula. This was a great help. Now I have to figure out how to explain cost of capital is used in net present value analysis, and how cost of capital is used in net present value analysis. This stuff gets confusing."
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
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
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.