How to minimise a function with both linear and exponent variable?
I am trying to minimise $N$ in the following equation with respect to $b$.
$$N = p^b + (1-p^b)(b+1)$$
Notes:
$ 0 le p le 1 $, because $p$ is a probability.
Background:
This is my interpretation of a problem concerning how a hospital can minimise the number of HIV blood tests $N$ it has to run by pooling blood samples into bundles $b$. The HIV test has a probability $p$ of returning negative (no HIV); by extrapolation, the bundle of $b$ samples has a probability of $p^b$ of returning negative. If the bundle returns a positive, each sample in the bundle will be tested individually, yielding $b+1$ tests, the bundle plus each individual sample in the bundle.
$N$ denotes the expected number of tests, and is the probability of a bundle negative multiplied by one test, plus the probability of a bundle negative multiplied by $b+1$ tests.
I wish to find an expression for the value of $b$ that minimises $N$ for a given $p$.
I attempted to use a Langrarian (I am new to the method) but had trouble isolating the $b$ term.
calculus optimization
add a comment |
I am trying to minimise $N$ in the following equation with respect to $b$.
$$N = p^b + (1-p^b)(b+1)$$
Notes:
$ 0 le p le 1 $, because $p$ is a probability.
Background:
This is my interpretation of a problem concerning how a hospital can minimise the number of HIV blood tests $N$ it has to run by pooling blood samples into bundles $b$. The HIV test has a probability $p$ of returning negative (no HIV); by extrapolation, the bundle of $b$ samples has a probability of $p^b$ of returning negative. If the bundle returns a positive, each sample in the bundle will be tested individually, yielding $b+1$ tests, the bundle plus each individual sample in the bundle.
$N$ denotes the expected number of tests, and is the probability of a bundle negative multiplied by one test, plus the probability of a bundle negative multiplied by $b+1$ tests.
I wish to find an expression for the value of $b$ that minimises $N$ for a given $p$.
I attempted to use a Langrarian (I am new to the method) but had trouble isolating the $b$ term.
calculus optimization
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43
add a comment |
I am trying to minimise $N$ in the following equation with respect to $b$.
$$N = p^b + (1-p^b)(b+1)$$
Notes:
$ 0 le p le 1 $, because $p$ is a probability.
Background:
This is my interpretation of a problem concerning how a hospital can minimise the number of HIV blood tests $N$ it has to run by pooling blood samples into bundles $b$. The HIV test has a probability $p$ of returning negative (no HIV); by extrapolation, the bundle of $b$ samples has a probability of $p^b$ of returning negative. If the bundle returns a positive, each sample in the bundle will be tested individually, yielding $b+1$ tests, the bundle plus each individual sample in the bundle.
$N$ denotes the expected number of tests, and is the probability of a bundle negative multiplied by one test, plus the probability of a bundle negative multiplied by $b+1$ tests.
I wish to find an expression for the value of $b$ that minimises $N$ for a given $p$.
I attempted to use a Langrarian (I am new to the method) but had trouble isolating the $b$ term.
calculus optimization
I am trying to minimise $N$ in the following equation with respect to $b$.
$$N = p^b + (1-p^b)(b+1)$$
Notes:
$ 0 le p le 1 $, because $p$ is a probability.
Background:
This is my interpretation of a problem concerning how a hospital can minimise the number of HIV blood tests $N$ it has to run by pooling blood samples into bundles $b$. The HIV test has a probability $p$ of returning negative (no HIV); by extrapolation, the bundle of $b$ samples has a probability of $p^b$ of returning negative. If the bundle returns a positive, each sample in the bundle will be tested individually, yielding $b+1$ tests, the bundle plus each individual sample in the bundle.
$N$ denotes the expected number of tests, and is the probability of a bundle negative multiplied by one test, plus the probability of a bundle negative multiplied by $b+1$ tests.
I wish to find an expression for the value of $b$ that minimises $N$ for a given $p$.
I attempted to use a Langrarian (I am new to the method) but had trouble isolating the $b$ term.
calculus optimization
calculus optimization
edited Nov 29 at 9:41
GNUSupporter 8964民主女神 地下教會
12.8k72445
12.8k72445
asked Nov 29 at 9:40
Alex Craggs
61
61
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43
add a comment |
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43
add a comment |
1 Answer
1
active
oldest
votes
$$N(b) = p^b+(1-p^b)(b+1)$$
if $p>0$,
$$N(0) = 1$$
From you description, $b$ is a physical quantity, $b ge 0$.
If $b>0$, then $N(b)$ is a convex combination between $1$ and $b+1$, which is certainly bigger than $1$. Hence the minimal value is attained at $b=0$.
If we want to impose conditions such as $b ge b_0 >0$, then $b_0$ is the quantity that you are looking for by the convex combination argument.
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
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%2f3018412%2fhow-to-minimise-a-function-with-both-linear-and-exponent-variable%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
$$N(b) = p^b+(1-p^b)(b+1)$$
if $p>0$,
$$N(0) = 1$$
From you description, $b$ is a physical quantity, $b ge 0$.
If $b>0$, then $N(b)$ is a convex combination between $1$ and $b+1$, which is certainly bigger than $1$. Hence the minimal value is attained at $b=0$.
If we want to impose conditions such as $b ge b_0 >0$, then $b_0$ is the quantity that you are looking for by the convex combination argument.
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
add a comment |
$$N(b) = p^b+(1-p^b)(b+1)$$
if $p>0$,
$$N(0) = 1$$
From you description, $b$ is a physical quantity, $b ge 0$.
If $b>0$, then $N(b)$ is a convex combination between $1$ and $b+1$, which is certainly bigger than $1$. Hence the minimal value is attained at $b=0$.
If we want to impose conditions such as $b ge b_0 >0$, then $b_0$ is the quantity that you are looking for by the convex combination argument.
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
add a comment |
$$N(b) = p^b+(1-p^b)(b+1)$$
if $p>0$,
$$N(0) = 1$$
From you description, $b$ is a physical quantity, $b ge 0$.
If $b>0$, then $N(b)$ is a convex combination between $1$ and $b+1$, which is certainly bigger than $1$. Hence the minimal value is attained at $b=0$.
If we want to impose conditions such as $b ge b_0 >0$, then $b_0$ is the quantity that you are looking for by the convex combination argument.
$$N(b) = p^b+(1-p^b)(b+1)$$
if $p>0$,
$$N(0) = 1$$
From you description, $b$ is a physical quantity, $b ge 0$.
If $b>0$, then $N(b)$ is a convex combination between $1$ and $b+1$, which is certainly bigger than $1$. Hence the minimal value is attained at $b=0$.
If we want to impose conditions such as $b ge b_0 >0$, then $b_0$ is the quantity that you are looking for by the convex combination argument.
edited Nov 29 at 9:59
answered Nov 29 at 9:48
Siong Thye Goh
98.6k1464116
98.6k1464116
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
add a comment |
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
Ah, how would I go about finding b0, where b0 > 0 using the convex combination method? Would it be possible to find an expression of b0 in terms of p?
– Alex Craggs
Nov 30 at 14:41
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
The reason why I mention that is because you are solving a physical problem, and I wasn't sure if $0$ will help you at all. So for your physical problem, to minimize that quantity, $b$ should be a positive or nonnegative number that is as small as possible given your physical constraint.
– Siong Thye Goh
Nov 30 at 14:49
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.
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%2f3018412%2fhow-to-minimise-a-function-with-both-linear-and-exponent-variable%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
Welcome to Math.SE. Please use MathJax for objects of mathematical discourse.
– GNUSupporter 8964民主女神 地下教會
Nov 29 at 9:43