Obtain an optimal solution for transportation problem
0
Consider Problem 8.1-1
I did (a) and (b).
For (c), should I solve using
1.minimum cost method and then method of multipliers ?
or
2.Vogel method and then method of multipliers ?
Is there an easier way to solve (c) (without using software)?
If so what is it?
optimization operations-research optimal-transport
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
|
show 3 more comments
0
Consider Problem 8.1-1
I did (a) and (b).
For (c), should I solve using
1.minimum cost method and then method of multipliers ?
or
2.Vogel method and then method of multipliers ?
Is there an easier way to solve (c) (without using software)?
If so what is it?
optimization operations-research optimal-transport
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16
|
show 3 more comments
0
0
0
Consider Problem 8.1-1
I did (a) and (b).
For (c), should I solve using
1.minimum cost method and then method of multipliers ?
or
2.Vogel method and then method of multipliers ?
Is there an easier way to solve (c) (without using software)?
If so what is it?
optimization operations-research optimal-transport
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
Consider Problem 8.1-1
I did (a) and (b).
For (c), should I solve using
1.minimum cost method and then method of multipliers ?
or
2.Vogel method and then method of multipliers ?
Is there an easier way to solve (c) (without using software)?
If so what is it?
optimization operations-research optimal-transport
optimization operations-research optimal-transport
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
asked Nov 29 '18 at 21:02
Al t.Al t.
4291519
4291519
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16
|
show 3 more comments
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16
|
show 3 more comments
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
});
}
});
draft saved
draft discarded
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%2f3019216%2fobtain-an-optimal-solution-for-transportation-problem%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
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
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%2f3019216%2fobtain-an-optimal-solution-for-transportation-problem%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
You can use en.wikipedia.org/wiki/Hungarian_algorithm
– Federico
Nov 29 '18 at 21:07
Alternatively, the transport problem is in particular a linear programming problem, so you can use any algorithm for that
– Federico
Nov 29 '18 at 21:08
I had never heard of Vogel approximation method, but it seems that it doesn't provide an actual solution, just a guess. I don't understand the utility for it. Just use the Hungarian algorithm or any LP solver
– Federico
Nov 29 '18 at 21:12
Look up the Stepping Stone and Modified Distribution Methods (MODI). You can probably find simple examples like yours on Youtube. Vogel's method simply finds an initial feasible solution which may be close enough to optimal or quite often optimal. The Hungarian Method is for assignment problems, a special case of transportation problems.
– Paul
Nov 29 '18 at 21:12
@Federico Vogel approximation method is used to find the basic solution, it's 'better' than minimum cost method according to my instructor.
– Al t.
Nov 29 '18 at 21:16