Mapping a problem to a standard optimization problem












0















Sorry if it is a naive question.



If a processor has N components which can be operated in any of M modes for a time-span of tp. There is a benefit (Rij) & cost (Pij) for each component i operated in j mode for time-span tp. The objective is to maximize total Rij for N components. The constraint is that total power of N component should be less that given power G. Another constraint is that processor execution time t should be less than a deadline for each time-span tp.




  1. To which standard optimization problems (Knapsack, Travelling
    salesman, ILP etc) can i map/formulate this problem perfectly?

  2. Any o pen-source tool to solve this?


Regards










share|improve this question























  • You can probably model it as an optimization problem, and solve it with something like pulp

    – juvian
    Nov 23 '18 at 16:58











  • @juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

    – Sajjad
    Nov 23 '18 at 18:58











  • You don´t need to map it to a known one, you can solve your own problem with a optimization solver

    – juvian
    Nov 23 '18 at 19:40











  • If you can add an example of inputs and expected output I can show the solution with pulp

    – juvian
    Nov 23 '18 at 19:51
















0















Sorry if it is a naive question.



If a processor has N components which can be operated in any of M modes for a time-span of tp. There is a benefit (Rij) & cost (Pij) for each component i operated in j mode for time-span tp. The objective is to maximize total Rij for N components. The constraint is that total power of N component should be less that given power G. Another constraint is that processor execution time t should be less than a deadline for each time-span tp.




  1. To which standard optimization problems (Knapsack, Travelling
    salesman, ILP etc) can i map/formulate this problem perfectly?

  2. Any o pen-source tool to solve this?


Regards










share|improve this question























  • You can probably model it as an optimization problem, and solve it with something like pulp

    – juvian
    Nov 23 '18 at 16:58











  • @juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

    – Sajjad
    Nov 23 '18 at 18:58











  • You don´t need to map it to a known one, you can solve your own problem with a optimization solver

    – juvian
    Nov 23 '18 at 19:40











  • If you can add an example of inputs and expected output I can show the solution with pulp

    – juvian
    Nov 23 '18 at 19:51














0












0








0








Sorry if it is a naive question.



If a processor has N components which can be operated in any of M modes for a time-span of tp. There is a benefit (Rij) & cost (Pij) for each component i operated in j mode for time-span tp. The objective is to maximize total Rij for N components. The constraint is that total power of N component should be less that given power G. Another constraint is that processor execution time t should be less than a deadline for each time-span tp.




  1. To which standard optimization problems (Knapsack, Travelling
    salesman, ILP etc) can i map/formulate this problem perfectly?

  2. Any o pen-source tool to solve this?


Regards










share|improve this question














Sorry if it is a naive question.



If a processor has N components which can be operated in any of M modes for a time-span of tp. There is a benefit (Rij) & cost (Pij) for each component i operated in j mode for time-span tp. The objective is to maximize total Rij for N components. The constraint is that total power of N component should be less that given power G. Another constraint is that processor execution time t should be less than a deadline for each time-span tp.




  1. To which standard optimization problems (Knapsack, Travelling
    salesman, ILP etc) can i map/formulate this problem perfectly?

  2. Any o pen-source tool to solve this?


Regards







optimization linear-programming knapsack-problem traveling-salesman






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 23 '18 at 10:56









SajjadSajjad

276




276













  • You can probably model it as an optimization problem, and solve it with something like pulp

    – juvian
    Nov 23 '18 at 16:58











  • @juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

    – Sajjad
    Nov 23 '18 at 18:58











  • You don´t need to map it to a known one, you can solve your own problem with a optimization solver

    – juvian
    Nov 23 '18 at 19:40











  • If you can add an example of inputs and expected output I can show the solution with pulp

    – juvian
    Nov 23 '18 at 19:51



















  • You can probably model it as an optimization problem, and solve it with something like pulp

    – juvian
    Nov 23 '18 at 16:58











  • @juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

    – Sajjad
    Nov 23 '18 at 18:58











  • You don´t need to map it to a known one, you can solve your own problem with a optimization solver

    – juvian
    Nov 23 '18 at 19:40











  • If you can add an example of inputs and expected output I can show the solution with pulp

    – juvian
    Nov 23 '18 at 19:51

















You can probably model it as an optimization problem, and solve it with something like pulp

– juvian
Nov 23 '18 at 16:58





You can probably model it as an optimization problem, and solve it with something like pulp

– juvian
Nov 23 '18 at 16:58













@juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

– Sajjad
Nov 23 '18 at 18:58





@juvian. OK, can i model it as any optimization problem? I have to check to which optimization problem can i map my problem to?

– Sajjad
Nov 23 '18 at 18:58













You don´t need to map it to a known one, you can solve your own problem with a optimization solver

– juvian
Nov 23 '18 at 19:40





You don´t need to map it to a known one, you can solve your own problem with a optimization solver

– juvian
Nov 23 '18 at 19:40













If you can add an example of inputs and expected output I can show the solution with pulp

– juvian
Nov 23 '18 at 19:51





If you can add an example of inputs and expected output I can show the solution with pulp

– juvian
Nov 23 '18 at 19:51












0






active

oldest

votes












Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53445368%2fmapping-a-problem-to-a-standard-optimization-problem%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
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • 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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53445368%2fmapping-a-problem-to-a-standard-optimization-problem%23new-answer', 'question_page');
}
);

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







這個網誌中的熱門文章

Hercules Kyvelos

Tangent Lines Diagram Along Smooth Curve

Yusuf al-Mu'taman ibn Hud