Linear Programming Model with Strict Inequality and Negative Constraint
$begingroup$
I just want to know if it is possible to convert this LP model into a standard LP model:
$max Z = 2x_1+4x_2$
subject to
$-2x_1+3x_2<3$
$4x_1+5x_2>10$
$x_1 leq 0$
$x_1<4$
$x_2$ unbounded
This is my first time seeing an LP model with strict inequalities and a negative constraint. I just always see the LP model with the usual inequalities and non-negative constraint and of course, I know how to convert those LP models into standard LP models
inequality linear-programming mathematical-modeling
$endgroup$
add a comment |
$begingroup$
I just want to know if it is possible to convert this LP model into a standard LP model:
$max Z = 2x_1+4x_2$
subject to
$-2x_1+3x_2<3$
$4x_1+5x_2>10$
$x_1 leq 0$
$x_1<4$
$x_2$ unbounded
This is my first time seeing an LP model with strict inequalities and a negative constraint. I just always see the LP model with the usual inequalities and non-negative constraint and of course, I know how to convert those LP models into standard LP models
inequality linear-programming mathematical-modeling
$endgroup$
add a comment |
$begingroup$
I just want to know if it is possible to convert this LP model into a standard LP model:
$max Z = 2x_1+4x_2$
subject to
$-2x_1+3x_2<3$
$4x_1+5x_2>10$
$x_1 leq 0$
$x_1<4$
$x_2$ unbounded
This is my first time seeing an LP model with strict inequalities and a negative constraint. I just always see the LP model with the usual inequalities and non-negative constraint and of course, I know how to convert those LP models into standard LP models
inequality linear-programming mathematical-modeling
$endgroup$
I just want to know if it is possible to convert this LP model into a standard LP model:
$max Z = 2x_1+4x_2$
subject to
$-2x_1+3x_2<3$
$4x_1+5x_2>10$
$x_1 leq 0$
$x_1<4$
$x_2$ unbounded
This is my first time seeing an LP model with strict inequalities and a negative constraint. I just always see the LP model with the usual inequalities and non-negative constraint and of course, I know how to convert those LP models into standard LP models
inequality linear-programming mathematical-modeling
inequality linear-programming mathematical-modeling
asked Jan 31 at 14:27
Ami78Ami78
52
52
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Replace $-2x_1+3x_2<3$ by
$$
-2x_1+3x_2 le 3-varepsilon
$$
where $varepsilon$ is a "very small" constant. And likewise for the other constraints.
$endgroup$
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
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%2f3094937%2flinear-programming-model-with-strict-inequality-and-negative-constraint%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$
Replace $-2x_1+3x_2<3$ by
$$
-2x_1+3x_2 le 3-varepsilon
$$
where $varepsilon$ is a "very small" constant. And likewise for the other constraints.
$endgroup$
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
add a comment |
$begingroup$
Replace $-2x_1+3x_2<3$ by
$$
-2x_1+3x_2 le 3-varepsilon
$$
where $varepsilon$ is a "very small" constant. And likewise for the other constraints.
$endgroup$
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
add a comment |
$begingroup$
Replace $-2x_1+3x_2<3$ by
$$
-2x_1+3x_2 le 3-varepsilon
$$
where $varepsilon$ is a "very small" constant. And likewise for the other constraints.
$endgroup$
Replace $-2x_1+3x_2<3$ by
$$
-2x_1+3x_2 le 3-varepsilon
$$
where $varepsilon$ is a "very small" constant. And likewise for the other constraints.
answered Jan 31 at 14:30


KuifjeKuifje
7,2722726
7,2722726
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
add a comment |
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
Can I just use $varepsilon$ for all the other constraints? Also, what about $x_1 leq 0$?
$endgroup$
– Ami78
Jan 31 at 14:57
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
$begingroup$
yes you can use the same $varepsilon$ for the other constraints. For $x_1le 0$, define $hat{x}_1 = - x_1$, rewrite the constraints in terms of $hat{x}_1$, and impose $hat{x}_1 ge 0$.
$endgroup$
– Kuifje
Jan 31 at 15:40
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%2f3094937%2flinear-programming-model-with-strict-inequality-and-negative-constraint%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