Finding a constraint on one variable of a multivariable function to constrain the entire function ...
Why could you hear an Amstrad CPC working?
Are there any other methods to apply to solving simultaneous equations?
Pristine Bit Checking
How can I create a character who can assume the widest possible range of creature sizes?
If a poisoned arrow's piercing damage is reduced to 0, do you still get poisoned?
Understanding the implication of what "well-defined" means for the operation in quotient group
Why can Shazam do this?
Is it possible for the two major parties in the UK to form a coalition with each other instead of a much smaller party?
What does Linus Torvalds means when he says that git "never ever" tracks a file?
How to manage monthly salary
Monty Hall variation
Any good smartcontract for "business calendar" oracles?
I looked up a future colleague on LinkedIn before I started a job. I told my colleague about it and he seemed surprised. Should I apologize?
Should I write numbers in words or as numerals when there are multiple next to each other?
Idiomatic way to prevent slicing?
Inline version of a function returns different value then non-inline version
Landlord wants to switch my lease to a "Land contract" to "get back at the city"
Does duplicating a spell with Wish count as casting that spell?
What is a mixture ratio of propellant?
What is the meaning of Triage in Cybersec world?
If the Wish spell is used to duplicate the effect of Simulacrum, are existing duplicates destroyed?
Does light intensity oscillate really fast since it is a wave?
Spanish for "widget"
What does "rabbited" mean/imply in this sentence?
Finding a constraint on one variable of a multivariable function to constrain the entire function
The 2019 Stack Overflow Developer Survey Results Are InFormulate A Minimizing Function that Prefers A Minimal Variable Over AnotherTrying to understand Lagrange multipliersAre there any global extrema in this Lagrange Multiplier problem?Prove that only the last constraint in this LP is tightHow to constrain the maximum distance between the highest and lowest values?Linearize Equality Constraint with Max FunctionImproving duality gap by adding redundant inequalitiesEntropy maximizing distribution when power constraint exists for one random variableMaximize a bivariate function under constraints by Lagrange multipliersFinding extrema of a tri-variable function under a constraint
$begingroup$
I have a function.
Now I want to let my variables only take values between 0, and 1.
The problem is as follows. For what values of Y, is L(x,y) < 0.
That is, without putting a further constraint on x(other than its between 0, 1), how can you bind Y, such that you bind L(x,y) below 0.
I graphed it out, and there is visually a range of y such that this is true.
I was unable to proceed. I thought of trying the mins and max for x, but then I noticed that really doesn't give me any useful information. I understand that the last inequality must be true for whenever L<0, including the range im looking for, but there must be some other point I am not taking into account that will give me a range independent of x.
multivariable-calculus optimization lagrange-multiplier maxima-minima constraints
$endgroup$
add a comment |
$begingroup$
I have a function.
Now I want to let my variables only take values between 0, and 1.
The problem is as follows. For what values of Y, is L(x,y) < 0.
That is, without putting a further constraint on x(other than its between 0, 1), how can you bind Y, such that you bind L(x,y) below 0.
I graphed it out, and there is visually a range of y such that this is true.
I was unable to proceed. I thought of trying the mins and max for x, but then I noticed that really doesn't give me any useful information. I understand that the last inequality must be true for whenever L<0, including the range im looking for, but there must be some other point I am not taking into account that will give me a range independent of x.
multivariable-calculus optimization lagrange-multiplier maxima-minima constraints
$endgroup$
add a comment |
$begingroup$
I have a function.
Now I want to let my variables only take values between 0, and 1.
The problem is as follows. For what values of Y, is L(x,y) < 0.
That is, without putting a further constraint on x(other than its between 0, 1), how can you bind Y, such that you bind L(x,y) below 0.
I graphed it out, and there is visually a range of y such that this is true.
I was unable to proceed. I thought of trying the mins and max for x, but then I noticed that really doesn't give me any useful information. I understand that the last inequality must be true for whenever L<0, including the range im looking for, but there must be some other point I am not taking into account that will give me a range independent of x.
multivariable-calculus optimization lagrange-multiplier maxima-minima constraints
$endgroup$
I have a function.
Now I want to let my variables only take values between 0, and 1.
The problem is as follows. For what values of Y, is L(x,y) < 0.
That is, without putting a further constraint on x(other than its between 0, 1), how can you bind Y, such that you bind L(x,y) below 0.
I graphed it out, and there is visually a range of y such that this is true.
I was unable to proceed. I thought of trying the mins and max for x, but then I noticed that really doesn't give me any useful information. I understand that the last inequality must be true for whenever L<0, including the range im looking for, but there must be some other point I am not taking into account that will give me a range independent of x.
multivariable-calculus optimization lagrange-multiplier maxima-minima constraints
multivariable-calculus optimization lagrange-multiplier maxima-minima constraints
edited Mar 23 at 19:38
physicsP
asked Mar 21 at 3:54
physicsPphysicsP
386
386
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Consider the four optimization problems, which cover the combinations of minimizing or maximizing y, when x is fixed at 0 or 1.
a) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
b) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
c) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
d) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
Solving these as having non-strict inequality $L(x,y) le 0$, the following solutions are obtained:
a) x = 0, y = 1/3
b) x = 0, y = 1
c) x = 1, y = 0
d) x = 1, y = 2/5.5
Given the linearity of L(x,y) for a fixed x, we can conclude that
when x = 0, then y in the interval (1/3,1] satisfies L(x,y) < 0
when x = 1, then y in the interval [0,2.5/5) satisfies L(x,y) < 0.
Due to the bilinearity of L(x,y), x = 0 and 1 are the extreme cases for x in [0,1] with regard to minimum and maximum possible values of y satisfying L(x,y) < 0.
Noting that 2.5/5 = 0.3626... we can therefore conclude that every value of y in the interval (1/3,2.5/5), and only values of y in that interval, will satisfy L(x,y) < 0 no matter which (i.e., "worst case") value of x in [0,1] is chosen.
$endgroup$
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
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%2f3156315%2ffinding-a-constraint-on-one-variable-of-a-multivariable-function-to-constrain-th%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$
Consider the four optimization problems, which cover the combinations of minimizing or maximizing y, when x is fixed at 0 or 1.
a) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
b) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
c) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
d) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
Solving these as having non-strict inequality $L(x,y) le 0$, the following solutions are obtained:
a) x = 0, y = 1/3
b) x = 0, y = 1
c) x = 1, y = 0
d) x = 1, y = 2/5.5
Given the linearity of L(x,y) for a fixed x, we can conclude that
when x = 0, then y in the interval (1/3,1] satisfies L(x,y) < 0
when x = 1, then y in the interval [0,2.5/5) satisfies L(x,y) < 0.
Due to the bilinearity of L(x,y), x = 0 and 1 are the extreme cases for x in [0,1] with regard to minimum and maximum possible values of y satisfying L(x,y) < 0.
Noting that 2.5/5 = 0.3626... we can therefore conclude that every value of y in the interval (1/3,2.5/5), and only values of y in that interval, will satisfy L(x,y) < 0 no matter which (i.e., "worst case") value of x in [0,1] is chosen.
$endgroup$
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
add a comment |
$begingroup$
Consider the four optimization problems, which cover the combinations of minimizing or maximizing y, when x is fixed at 0 or 1.
a) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
b) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
c) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
d) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
Solving these as having non-strict inequality $L(x,y) le 0$, the following solutions are obtained:
a) x = 0, y = 1/3
b) x = 0, y = 1
c) x = 1, y = 0
d) x = 1, y = 2/5.5
Given the linearity of L(x,y) for a fixed x, we can conclude that
when x = 0, then y in the interval (1/3,1] satisfies L(x,y) < 0
when x = 1, then y in the interval [0,2.5/5) satisfies L(x,y) < 0.
Due to the bilinearity of L(x,y), x = 0 and 1 are the extreme cases for x in [0,1] with regard to minimum and maximum possible values of y satisfying L(x,y) < 0.
Noting that 2.5/5 = 0.3626... we can therefore conclude that every value of y in the interval (1/3,2.5/5), and only values of y in that interval, will satisfy L(x,y) < 0 no matter which (i.e., "worst case") value of x in [0,1] is chosen.
$endgroup$
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
add a comment |
$begingroup$
Consider the four optimization problems, which cover the combinations of minimizing or maximizing y, when x is fixed at 0 or 1.
a) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
b) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
c) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
d) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
Solving these as having non-strict inequality $L(x,y) le 0$, the following solutions are obtained:
a) x = 0, y = 1/3
b) x = 0, y = 1
c) x = 1, y = 0
d) x = 1, y = 2/5.5
Given the linearity of L(x,y) for a fixed x, we can conclude that
when x = 0, then y in the interval (1/3,1] satisfies L(x,y) < 0
when x = 1, then y in the interval [0,2.5/5) satisfies L(x,y) < 0.
Due to the bilinearity of L(x,y), x = 0 and 1 are the extreme cases for x in [0,1] with regard to minimum and maximum possible values of y satisfying L(x,y) < 0.
Noting that 2.5/5 = 0.3626... we can therefore conclude that every value of y in the interval (1/3,2.5/5), and only values of y in that interval, will satisfy L(x,y) < 0 no matter which (i.e., "worst case") value of x in [0,1] is chosen.
$endgroup$
Consider the four optimization problems, which cover the combinations of minimizing or maximizing y, when x is fixed at 0 or 1.
a) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
b) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 0$
c) min w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
d) max w.r.t. y subject to $0 le y le 1, L(x,y) < 0, x = 1$
Solving these as having non-strict inequality $L(x,y) le 0$, the following solutions are obtained:
a) x = 0, y = 1/3
b) x = 0, y = 1
c) x = 1, y = 0
d) x = 1, y = 2/5.5
Given the linearity of L(x,y) for a fixed x, we can conclude that
when x = 0, then y in the interval (1/3,1] satisfies L(x,y) < 0
when x = 1, then y in the interval [0,2.5/5) satisfies L(x,y) < 0.
Due to the bilinearity of L(x,y), x = 0 and 1 are the extreme cases for x in [0,1] with regard to minimum and maximum possible values of y satisfying L(x,y) < 0.
Noting that 2.5/5 = 0.3626... we can therefore conclude that every value of y in the interval (1/3,2.5/5), and only values of y in that interval, will satisfy L(x,y) < 0 no matter which (i.e., "worst case") value of x in [0,1] is chosen.
edited Mar 23 at 17:48
answered Mar 23 at 17:42
Mark L. StoneMark L. Stone
1,95058
1,95058
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
add a comment |
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
$begingroup$
What do you mean when you say linearity? "Given the linearity of L(x,y) for a fixed x" do you mean for a fixed x it is linear in x or y? What exactly is the reasoning behind using edges?
$endgroup$
– physicsP
Mar 23 at 19:28
1
1
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
For a fixed x, L(x,y) is linear in y.
$endgroup$
– Mark L. Stone
Mar 23 at 19:29
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
What do you mean by "using edges" in your comment question "What exactly is the reasoning behind using edges?"? Are you asking about my use of the term "extreme cases".? I chose x = 0 and x = 1 as extreme cases, because no intermediate value of x could lead to more extreme bounds on possible y because L(x,y) is linear in y for a fixed x.
$endgroup$
– Mark L. Stone
Mar 23 at 19:44
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
$begingroup$
You have now changed the question so as to eliminate the specification of particular function L(x,y). For such a general case, no conclusions can be drawn in general. Nothing in my answer or previous comments necessarily holds for your edited question. However, if you can state that L(x,y) is bilinear, i.e., linear in y when x is fixed and linear in x when y is fixed, then the methodology I stated above still applies, even though the solution may change.
$endgroup$
– Mark L. Stone
Mar 23 at 19:50
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%2f3156315%2ffinding-a-constraint-on-one-variable-of-a-multivariable-function-to-constrain-th%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