why can we tackle a matrix with linearly dependent rows while driving artificial variables out of the basis?
$begingroup$
in introduction to linear programming, section 3.5 driving artificial variables out of the basis, the authors consider the case where that when trying to drive the lth basic variable (which is artificial), we find out that the lth row of $B^{-1}A$ is zero, which means that A has linearly dependent rows (last paragraph of page 113)
How is that possible? I thought that our assumption is that A has full rank! and that we test for that before the optimization...
Thanks!
related to why in Phase I of the simplex method, if artificial variable become nonbasic, it never become basic?
optimization linear-programming simplex
$endgroup$
add a comment |
$begingroup$
in introduction to linear programming, section 3.5 driving artificial variables out of the basis, the authors consider the case where that when trying to drive the lth basic variable (which is artificial), we find out that the lth row of $B^{-1}A$ is zero, which means that A has linearly dependent rows (last paragraph of page 113)
How is that possible? I thought that our assumption is that A has full rank! and that we test for that before the optimization...
Thanks!
related to why in Phase I of the simplex method, if artificial variable become nonbasic, it never become basic?
optimization linear-programming simplex
$endgroup$
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27
add a comment |
$begingroup$
in introduction to linear programming, section 3.5 driving artificial variables out of the basis, the authors consider the case where that when trying to drive the lth basic variable (which is artificial), we find out that the lth row of $B^{-1}A$ is zero, which means that A has linearly dependent rows (last paragraph of page 113)
How is that possible? I thought that our assumption is that A has full rank! and that we test for that before the optimization...
Thanks!
related to why in Phase I of the simplex method, if artificial variable become nonbasic, it never become basic?
optimization linear-programming simplex
$endgroup$
in introduction to linear programming, section 3.5 driving artificial variables out of the basis, the authors consider the case where that when trying to drive the lth basic variable (which is artificial), we find out that the lth row of $B^{-1}A$ is zero, which means that A has linearly dependent rows (last paragraph of page 113)
How is that possible? I thought that our assumption is that A has full rank! and that we test for that before the optimization...
Thanks!
related to why in Phase I of the simplex method, if artificial variable become nonbasic, it never become basic?
optimization linear-programming simplex
optimization linear-programming simplex
edited Jan 15 at 12:27
ihadanny
asked Jan 14 at 21:16
ihadannyihadanny
1257
1257
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27
add a comment |
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073754%2fwhy-can-we-tackle-a-matrix-with-linearly-dependent-rows-while-driving-artificial%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073754%2fwhy-can-we-tackle-a-matrix-with-linearly-dependent-rows-while-driving-artificial%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Please specify where you´ve read that the lth row is $0$.
$endgroup$
– callculus
Jan 15 at 6:26
$begingroup$
@callculus - edited
$endgroup$
– ihadanny
Jan 15 at 12:27