Why basic feasible solution of a transportation problem always involves not more than $m+n-1$ allocations?
$begingroup$
I was reading Balanced transportation problem. I got stuck in the conditions of Basic Feasible solution.
If we suppose a transportation problem where $m$ number of supply points and $n$ number of demand points then why the basic feasible solution always involves not more than $m+n-1$ allocations.
My confusion --- If we consider this transportation problem as L.P.P problem then it will have $m+n$ equations and $mn$ variable. So we can get $m+n$ basic variable. i.e there can be $m+n$ allocation .
But it does not happen. Whenever we see there is $m+n$ allocations we can be confident that there is a loop.
Can anyone please help me to understand where I am missunderstanding?
Can anyone please help me ?
linear-algebra linear-programming
$endgroup$
add a comment |
$begingroup$
I was reading Balanced transportation problem. I got stuck in the conditions of Basic Feasible solution.
If we suppose a transportation problem where $m$ number of supply points and $n$ number of demand points then why the basic feasible solution always involves not more than $m+n-1$ allocations.
My confusion --- If we consider this transportation problem as L.P.P problem then it will have $m+n$ equations and $mn$ variable. So we can get $m+n$ basic variable. i.e there can be $m+n$ allocation .
But it does not happen. Whenever we see there is $m+n$ allocations we can be confident that there is a loop.
Can anyone please help me to understand where I am missunderstanding?
Can anyone please help me ?
linear-algebra linear-programming
$endgroup$
$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29
add a comment |
$begingroup$
I was reading Balanced transportation problem. I got stuck in the conditions of Basic Feasible solution.
If we suppose a transportation problem where $m$ number of supply points and $n$ number of demand points then why the basic feasible solution always involves not more than $m+n-1$ allocations.
My confusion --- If we consider this transportation problem as L.P.P problem then it will have $m+n$ equations and $mn$ variable. So we can get $m+n$ basic variable. i.e there can be $m+n$ allocation .
But it does not happen. Whenever we see there is $m+n$ allocations we can be confident that there is a loop.
Can anyone please help me to understand where I am missunderstanding?
Can anyone please help me ?
linear-algebra linear-programming
$endgroup$
I was reading Balanced transportation problem. I got stuck in the conditions of Basic Feasible solution.
If we suppose a transportation problem where $m$ number of supply points and $n$ number of demand points then why the basic feasible solution always involves not more than $m+n-1$ allocations.
My confusion --- If we consider this transportation problem as L.P.P problem then it will have $m+n$ equations and $mn$ variable. So we can get $m+n$ basic variable. i.e there can be $m+n$ allocation .
But it does not happen. Whenever we see there is $m+n$ allocations we can be confident that there is a loop.
Can anyone please help me to understand where I am missunderstanding?
Can anyone please help me ?
linear-algebra linear-programming
linear-algebra linear-programming
asked Jan 31 at 16:45
cmicmi
1,141312
1,141312
$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29
add a comment |
$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29
$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29
$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The transportation problem only has $m+n-1$ independent constraints, see this answer. That means that there cannot be $m+n$ basic variables, but only $n+m-1$.
$endgroup$
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
add a comment |
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%2f3095128%2fwhy-basic-feasible-solution-of-a-transportation-problem-always-involves-not-more%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The transportation problem only has $m+n-1$ independent constraints, see this answer. That means that there cannot be $m+n$ basic variables, but only $n+m-1$.
$endgroup$
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
add a comment |
$begingroup$
The transportation problem only has $m+n-1$ independent constraints, see this answer. That means that there cannot be $m+n$ basic variables, but only $n+m-1$.
$endgroup$
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
add a comment |
$begingroup$
The transportation problem only has $m+n-1$ independent constraints, see this answer. That means that there cannot be $m+n$ basic variables, but only $n+m-1$.
$endgroup$
The transportation problem only has $m+n-1$ independent constraints, see this answer. That means that there cannot be $m+n$ basic variables, but only $n+m-1$.
answered Jan 31 at 16:51
LinAlgLinAlg
10.1k1521
10.1k1521
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
add a comment |
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
$begingroup$
I think this question it's actually a duplicate of my question. Isn't it?
$endgroup$
– Al t.
Feb 3 at 2:13
1
1
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
$begingroup$
@Alt. yes, although you seemed more appreciative of the answer :)
$endgroup$
– LinAlg
Feb 3 at 2:19
add a comment |
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%2f3095128%2fwhy-basic-feasible-solution-of-a-transportation-problem-always-involves-not-more%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$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29