Mixing
Find the optimal solution using dual simplex algorithm
0
$begingroup$
Maximize $ z=-5x_1+10x_2+8x_3$
subject to constraints
$3x_1+5x_2+2x_3<=60$
$4x_1+4x_2+4x_3>=72$
$x_1<=0$
$x_1,x_2,x_3>=0$
Thanks for help :)
optimization linear-programming simplex
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
$endgroup$
|
show 9 more comments
0
$begingroup$
Maximize $ z=-5x_1+10x_2+8x_3$
subject to constraints
$3x_1+5x_2+2x_3<=60$
$4x_1+4x_2+4x_3>=72$
$x_1<=0$
$x_1,x_2,x_3>=0$
Thanks for help :)
optimization linear-programming simplex
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
$endgroup$
$begingroup$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43
|
show 9 more comments
0
0
0
$begingroup$
Maximize $ z=-5x_1+10x_2+8x_3$
subject to constraints
$3x_1+5x_2+2x_3<=60$
$4x_1+4x_2+4x_3>=72$
$x_1<=0$
$x_1,x_2,x_3>=0$
Thanks for help :)
optimization linear-programming simplex
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
$endgroup$
Maximize $ z=-5x_1+10x_2+8x_3$
subject to constraints
$3x_1+5x_2+2x_3<=60$
$4x_1+4x_2+4x_3>=72$
$x_1<=0$
$x_1,x_2,x_3>=0$
Thanks for help :)
optimization linear-programming simplex
optimization linear-programming simplex
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
asked Jan 30 at 21:12
Corn of DoomCorn of Doom
315
315
$begingroup$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43
|
show 9 more comments
$begingroup$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43
$begingroup$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43
|
show 9 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%2f3094121%2ffind-the-optimal-solution-using-dual-simplex-algorithm%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%2f3094121%2ffind-the-optimal-solution-using-dual-simplex-algorithm%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$
At which step did a problem occur? One important hint: For $=$ and $geq$ constraints you need an artificial variable each.
$endgroup$
– callculus
Jan 30 at 21:21
$begingroup$
In the initial table on row all values are not$ <=0$ but i do not know what to do next :(
$endgroup$
– Corn of Doom
Jan 30 at 21:30
$begingroup$
It´s not clear for me what do you mean by your comment. Please rephrase it. Something what is obvious is that $x_1=0$ if you combine the constraints $x_1leq 0$ and $x_1geq 0$. Therefore you can drop the terms with $x_1$ at the objetive function and the constraints.
$endgroup$
– callculus
Jan 30 at 21:35
$begingroup$
The best you can do is to show your initial table.
$endgroup$
– callculus
Jan 30 at 21:39
$begingroup$
One second pls :)
$endgroup$
– Corn of Doom
Jan 30 at 21:43