Why basic feasible solution of a transportation problem always involves not more than $m+n-1$ allocations?












0












$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 ?










share|cite|improve this question









$endgroup$












  • $begingroup$
    did I answer your question?
    $endgroup$
    – LinAlg
    Feb 25 at 16:29
















0












$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 ?










share|cite|improve this question









$endgroup$












  • $begingroup$
    did I answer your question?
    $endgroup$
    – LinAlg
    Feb 25 at 16:29














0












0








0





$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 ?










share|cite|improve this question









$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






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 31 at 16:45









cmicmi

1,141312




1,141312












  • $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




$begingroup$
did I answer your question?
$endgroup$
– LinAlg
Feb 25 at 16:29










1 Answer
1






active

oldest

votes


















1












$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$.






share|cite|improve this answer









$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












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
});


}
});














draft saved

draft discarded


















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









1












$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$.






share|cite|improve this answer









$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
















1












$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$.






share|cite|improve this answer









$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














1












1








1





$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$.






share|cite|improve this answer









$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$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










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


















  • $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


















draft saved

draft discarded




















































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.




draft saved


draft discarded














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





















































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







Popular posts from this blog

'app-layout' is not a known element: how to share Component with different Modules

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

WPF add header to Image with URL pettitions [duplicate]