Question
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to:...
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to: 4X + 4Y ≤ 48 (constraint #1) 2X + 3Y ≤ 50 (constraint #2) 1X + 2Y ≤ 20 (constraint #3) Y ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints) (a) Which of the constraints is redundant? Constraint #____. Justify using the data from the above LP model: ________________________________________________________________________ ________________________________________________________________________ ________________________________________________________________________ (b) Is solution point (10,5) a feasible solution? _____. Explain using the data from above LP model: ________________________________________________________________________ ________________________________________________________________________ (c) Which of the following points yields the best solution? Underline the best one: (7, 5), (2, 8), (6, 6). Justify your answer using the data from the above LP model: ________________________________________________________________________ ________________________________________________________________________ ________________________________________________________________________
Homework Answers
Answer #1
Not the answer you're looking for?
Similar Questions
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0...
Consider the following Linear Programming model:
Maximize x+2.5y
Subject to
x+3y<=12
x+2y<=11
x-2y<=9
x-y>=0
x+5y<=15
x>=0
y>=0
(a) Draw the feasible region for the model, but DO NOT draw the
objective function. Without graphing the objective function, find
the optimal solution(s) and the optimal value. Justify your method
and why the solution(s) you obtain is (are) optimal. (4 points)
(b) Add the constraint “x+5y>=15” to the Linear Programming
model. Is the optimal solution the same as the one in (a)?...
Consider the following linear programming problem. Maximize P = 3x + 9y subject to the constraints...
Consider the following linear programming problem.
Maximize
P = 3x + 9y
subject to the constraints
3x + 8y ≤ 1
4x − 5y ≤ 4
2x + 7y ≤ 6
x ≥ 0, y ≥ 0
Write the initial simplex tableau.
x
y
s1
s2
s3
P
Constant
1
4
6
0
Consider the following linear programming problem. Maximize P = 4x + 6y + 9z subject to...
Consider the following linear programming problem.
Maximize
P = 4x + 6y + 9z
subject to the constraints
2x
+
3y
+
z
≤
900
3x
+
y
+
z
≤
350
4x
+
2y
+
z
≤
400
x ≥ 0, y ≥ 0, z ≥ 0
Write the initial simplex tableau.
x
y
z
s1
s2
s3
P
Constant
900
350
400
0
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have
been graphed on the graph paper provided to form a feasible
region:
2X + 6Y
>= 120
10X + 2Y > = 200
X + Y
<= 120
X
<= 100
Y <= 80
X,Y
>= 0
Using the graphical method, determine the optional solution and
the objective function value for the following objective functions.
Graph the objective function as a dashed line on the feasible
region described by the...
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have
been graphed on the graph paper provided (same constraints found in
problem #3) to form a feasible region:
2X + 6Y
>= 120
10X + 2Y > = 200
X +
Y <= 120
X
<= 100
Y <= 80
X,Y
>= 0
Using the graphical method, determine the optional solution and
the objective function value for the following objective functions.
Graph the objective function as a dashed line on...
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the
graphical method: graph the constraints and identify the feasible
region. Using the corner points method, determine the optimal
solution (s) (show your work).
Maximize Z = 6.5x1 + 10x2
Subject to x1 + x2 ≤ 15
2x1 + 4x2 ≤ 40
x1 ≥ 8
x1, x2 ≥ 0
b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect
does this have on the optimal solution? Are...
Question 5 options: Consider the following integer linear programming problem: Max Z = 3x +...
Question 5 options:
Consider the following integer linear programming problem:
Max Z = 3x +
2y
Subject to: 3x + 5y ? 30
4x + 2y ? 28
x
? 8
x
, y ? 0 and integer
The solution to the linear programming formulation is:
x = 5.714, y = 2.571.
What is the optimal solution to the integer
linear programming problem?
State the optimal values of decision variables and the value of
the objective function.
Consider the following linear programming problem Manimize $2Y + $5X Subject To 5Y + 10X ≥...
Consider the following linear programming problem
Manimize
$2Y + $5X
Subject To
5Y + 10X ≥ 90
Constraint A
3Y + 9X ≥ 48
Constraint B
X, Y ≥ 0
Constraint C
if A and B are the two binding constraints.
a) What is the range of optimality of
the objective function?
Answer ≤ C1/C2 ≤ Answer
b) Suppose that the unit revenues for Y and X are changed to $20
and $45, respectively. Will the current optimum remain the
same?
AnswerYesNO...
Question 5 options: Consider the following integer linear programming problem: Max Z = 3x +...
Question 5 options:
Consider the following integer linear programming problem:
Max Z = 3x +
2y
Subject to: 3x + 5y ≤ 30
5x + 2y ≤ 28
x
≤ 8
x,
y ≥ 0 and integer
The solution to the linear programming formulation is:
x = 4.21, y = 3.47.
What is the optimal solution to the integer
linear programming problem?
State the optimal values of decision variables.
x =
, y =
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the
graphical method: graph the constraints and identify the feasible
region then determine the optimal solution (s) (show your
work).
Minimize Z = 3x1 + 7x2
Subject to 9x1 + 3x2 ≥ 36
4x1 + 5x2 ≥ 40
x1 – x2 ≤ 0
2x1 ≤ 13
x1, x2 ≥ 0
b. Are any constraints binding? If so, which one (s)?
ADVERTISEMENT
Need Online Homework Help?
Get Answers For Free
Most questions answered within 1 hours.
ADVERTISEMENT
Active Questions
asked 3 minutes ago
asked 10 minutes ago
asked 11 minutes ago
asked 11 minutes ago
asked 23 minutes ago
asked 47 minutes ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago