2. Suppose you are maximizing the objective z. Identify which one of the following statements is correct, and answer the corresponding question. (a) The current basic feasible solution is optimal. If so, what is an optimal solution and the optimal objective value? (b) The linear program is unbounded. If so, provide a solution with objective value z = 5000 or larger. (c) At least one more iteration of the simplex algorithm is required to solve this problem. If so, identify which variable will leave the basis (go from being basic to being nonbasic), and which variable will enter the basis in the next iteration.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.2: Direct Methods For Solving Linear Systems
Problem 4AEXP
icon
Related questions
Question
Please answer correctly please! Write it by hand please. Answer part 2. Please
Problem 1 Consider the following simplex tableau.
Row z
X2 x3 x4 25
X6 17 rg RHS
BV
0.
1
0 -5
4 -1 –10
0 620 z = 620
1
3
0 -2 -3
-1
1
12
0 0
1
1
3
1
6.
0 1 -1
0 6 -4
0 0 0
1. Which variables are basic and which variables are nonbasic in this tableau? What basic
variables are associated with rows 1, 2, and 3 of this tableau? What are the values of all the
variables associated with this basic feasible solution?
2. Suppose you are maximizing the objective z. Identify which one of the following statements
is correct, and answer the corresponding question.
(a) The current basic feasible solution is optimal. If so, what is an optimal solution and the
optimal objective value?
(b) The linear program is unbounded. If so, provide a solution with objective value z = 5000
or larger.
(c) At least one more iteration of the simplex algorithm is required to solve this problem. If
so, identify which variable will leave the basis (go from being basic to being nonbasic),
and which variable will enter the basis in the next iteration.
3.
Transcribed Image Text:Problem 1 Consider the following simplex tableau. Row z X2 x3 x4 25 X6 17 rg RHS BV 0. 1 0 -5 4 -1 –10 0 620 z = 620 1 3 0 -2 -3 -1 1 12 0 0 1 1 3 1 6. 0 1 -1 0 6 -4 0 0 0 1. Which variables are basic and which variables are nonbasic in this tableau? What basic variables are associated with rows 1, 2, and 3 of this tableau? What are the values of all the variables associated with this basic feasible solution? 2. Suppose you are maximizing the objective z. Identify which one of the following statements is correct, and answer the corresponding question. (a) The current basic feasible solution is optimal. If so, what is an optimal solution and the optimal objective value? (b) The linear program is unbounded. If so, provide a solution with objective value z = 5000 or larger. (c) At least one more iteration of the simplex algorithm is required to solve this problem. If so, identify which variable will leave the basis (go from being basic to being nonbasic), and which variable will enter the basis in the next iteration. 3.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning