Soft Question: Optimization
$begingroup$
Let $N$ be the number of locations for hotspots. Each has its cost and achievable rate. I want to find the optimal combinations of $n leq N$ locations such the cost is minimized. How can I do so without computing all possible combinations?
optimization algorithms numerical-optimization
asked Jan 14 at 8:06
LodLod
128113
$endgroup$
add a comment |
$begingroup$
Let $N$ be the number of locations for hotspots. Each has its cost and achievable rate. I want to find the optimal combinations of $n leq N$ locations such the cost is minimized. How can I do so without computing all possible combinations?
optimization algorithms numerical-optimization
asked Jan 14 at 8:06
LodLod
128113
$endgroup$
$begingroup$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07
add a comment |
$begingroup$
Let $N$ be the number of locations for hotspots. Each has its cost and achievable rate. I want to find the optimal combinations of $n leq N$ locations such the cost is minimized. How can I do so without computing all possible combinations?
optimization algorithms numerical-optimization
asked Jan 14 at 8:06
LodLod
128113
$endgroup$
Let $N$ be the number of locations for hotspots. Each has its cost and achievable rate. I want to find the optimal combinations of $n leq N$ locations such the cost is minimized. How can I do so without computing all possible combinations?
optimization algorithms numerical-optimization
optimization algorithms numerical-optimization
asked Jan 14 at 8:06
LodLod
128113
asked Jan 14 at 8:06
LodLod
128113
asked Jan 14 at 8:06
LodLod
128113
asked Jan 14 at 8:06
LodLod
128113
asked Jan 14 at 8:06
LodLod
128113
128113
$begingroup$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07
add a comment |
$begingroup$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07
$begingroup$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07
add a comment |
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
});
}
});
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%2f3072965%2fsoft-question-optimization%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
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%2f3072965%2fsoft-question-optimization%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$
What's your constraint? A total achievable rate is given as part of the problem?
$endgroup$
– kodlu
Jan 15 at 0:04
$begingroup$
Sounds like an instance of the Facility Location Problem (which can be solved using integer programming)
$endgroup$
– David M.
Jan 15 at 5:07