Find upper bound for $frac{b(abc)^2 (1+bx)x}{a((1+s)(1+bx)+bs(T-x))^2}$
I want to find an expression for an upper bound for $$F(x) = frac{b(abs)^2 (1+bx)x}{a((1+s)(1+bx)+bs(T-x))^2},$$
where $a,b,s, T$ are constants, $a,b,s$ are positive, and $x leq T$, and subject to the constraint that $frac{abs}{1+s(1+bx)} leq K$.
Here's what I did:
The values of the numerator varies as $x(bx+1)$ varies, which is continuous everywhere and positive for positive values of $x$. Hence, the value of the numerator is maximum when $x=T$. This also makes $bs(T-x)$ in the denominator vanish. So we have
begin{align*}
F(x) & leq frac{b(abs)^2 (1+bT)T}{a((1+s)(1+bT))^2}\
& = frac{b(abs)^2 T}{a(1+s)^2(1+bT)}\
& leq frac{bK^2 (1+s(1+bT))^2 T}{a(1+s)^2(1+bT)}
end{align*}
The last inequality comes from the constraint involving $K$.
Now, I realize that my reasoning hinges on the fact that $x$ is positive. How can I improve this solution of mine?
upper-lower-bounds
add a comment |
I want to find an expression for an upper bound for $$F(x) = frac{b(abs)^2 (1+bx)x}{a((1+s)(1+bx)+bs(T-x))^2},$$
where $a,b,s, T$ are constants, $a,b,s$ are positive, and $x leq T$, and subject to the constraint that $frac{abs}{1+s(1+bx)} leq K$.
Here's what I did:
The values of the numerator varies as $x(bx+1)$ varies, which is continuous everywhere and positive for positive values of $x$. Hence, the value of the numerator is maximum when $x=T$. This also makes $bs(T-x)$ in the denominator vanish. So we have
begin{align*}
F(x) & leq frac{b(abs)^2 (1+bT)T}{a((1+s)(1+bT))^2}\
& = frac{b(abs)^2 T}{a(1+s)^2(1+bT)}\
& leq frac{bK^2 (1+s(1+bT))^2 T}{a(1+s)^2(1+bT)}
end{align*}
The last inequality comes from the constraint involving $K$.
Now, I realize that my reasoning hinges on the fact that $x$ is positive. How can I improve this solution of mine?
upper-lower-bounds
add a comment |
I want to find an expression for an upper bound for $$F(x) = frac{b(abs)^2 (1+bx)x}{a((1+s)(1+bx)+bs(T-x))^2},$$
where $a,b,s, T$ are constants, $a,b,s$ are positive, and $x leq T$, and subject to the constraint that $frac{abs}{1+s(1+bx)} leq K$.
Here's what I did:
The values of the numerator varies as $x(bx+1)$ varies, which is continuous everywhere and positive for positive values of $x$. Hence, the value of the numerator is maximum when $x=T$. This also makes $bs(T-x)$ in the denominator vanish. So we have
begin{align*}
F(x) & leq frac{b(abs)^2 (1+bT)T}{a((1+s)(1+bT))^2}\
& = frac{b(abs)^2 T}{a(1+s)^2(1+bT)}\
& leq frac{bK^2 (1+s(1+bT))^2 T}{a(1+s)^2(1+bT)}
end{align*}
The last inequality comes from the constraint involving $K$.
Now, I realize that my reasoning hinges on the fact that $x$ is positive. How can I improve this solution of mine?
upper-lower-bounds
I want to find an expression for an upper bound for $$F(x) = frac{b(abs)^2 (1+bx)x}{a((1+s)(1+bx)+bs(T-x))^2},$$
where $a,b,s, T$ are constants, $a,b,s$ are positive, and $x leq T$, and subject to the constraint that $frac{abs}{1+s(1+bx)} leq K$.
Here's what I did:
The values of the numerator varies as $x(bx+1)$ varies, which is continuous everywhere and positive for positive values of $x$. Hence, the value of the numerator is maximum when $x=T$. This also makes $bs(T-x)$ in the denominator vanish. So we have
begin{align*}
F(x) & leq frac{b(abs)^2 (1+bT)T}{a((1+s)(1+bT))^2}\
& = frac{b(abs)^2 T}{a(1+s)^2(1+bT)}\
& leq frac{bK^2 (1+s(1+bT))^2 T}{a(1+s)^2(1+bT)}
end{align*}
The last inequality comes from the constraint involving $K$.
Now, I realize that my reasoning hinges on the fact that $x$ is positive. How can I improve this solution of mine?
upper-lower-bounds
upper-lower-bounds
asked Nov 19 '18 at 4:28
user161300
666
666
add a comment |
add a comment |
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
});
}
});
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%2f3004523%2ffind-upper-bound-for-fracbabc2-1bxxa1s1bxbst-x2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3004523%2ffind-upper-bound-for-fracbabc2-1bxxa1s1bxbst-x2%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