Obtaining the intermediate solutions in AMPLSolver rounding precision vs programming language rounding precisionHow to get bounds on ILP optimal solution qualityDeclare numerical-sequence set in AMPL .dat fileFeeding known lower bounds to solversWhen is the original BFGS algorithm still better than the Limited-Memory version?How to select a Constraint Programming Solver“Best practices” for formulating MIPsNLP solvers in pyomo other than ipopt?Linearize or approximate a square root constraintRepresenting an indicator function: binary variables and “indicator constraints”
How do the Etherealness and Banishment spells interact?
How long do you think advanced cybernetic implants would plausibly last?
Who was president of the USA?
What is the difference between Major and Minor Bug?
Why is there so little discussion / research on the philosophy of precision?
Why in most German places is the church the tallest building?
Does an atom recoil when photon radiate?
Two questions about typesetting a Roman missal
I don't have the theoretical background in my PhD topic. I can't justify getting the degree
How do you interpolate outside the range of data?
Prevent use of CNAME Record for Untrusted Domain
Why are non-collision-resistant hash functions considered insecure for signing self-generated information
Circular Reasoning for Epsilon-Delta Proof?
Is "The life is beautiful" incorrect or just very non-idiomatic?
Papers on arXiv solving the same problem at the same time
Showing that the limit of non-eigenvector goes to infinity
Are the A380 engines interchangeable (given they are not all equipped with reverse)?
Did anyone try to find the little box that held Professor Moriarty and his wife after the crash?
How to gently end involvement with an online community?
Prove your innocence
Non-visual Computers - thoughts?
How to respectfully refuse to assist co-workers with IT issues?
Add newline to prompt if it's too long
Why is 1. d4 Nf6 2. c4 e6 3. Bg5 almost never played?
Obtaining the intermediate solutions in AMPL
Solver rounding precision vs programming language rounding precisionHow to get bounds on ILP optimal solution qualityDeclare numerical-sequence set in AMPL .dat fileFeeding known lower bounds to solversWhen is the original BFGS algorithm still better than the Limited-Memory version?How to select a Constraint Programming Solver“Best practices” for formulating MIPsNLP solvers in pyomo other than ipopt?Linearize or approximate a square root constraintRepresenting an indicator function: binary variables and “indicator constraints”
$begingroup$
I know that for some solvers, for example, the constraint programming solver in Google OR-Tools, it is possible to see all the intermediate solutions that the solver finds while it searches for an optimal solution. (An example is in this link.) I need these step-wise partial solutions to visualize the evolution of the optimization process in a physical example where I have a nonlinear 0-1 integer problem that I programmed in AMPL.
My questions are:
When solving nonlinear 0-1 integer problems, is it logical to consider such intermediate solutions?
Is it possible to obtain the intermediate solutions of solvers using AMPL? Which solvers have such a feature for AMPL?
integer-programming solver nonlinear-programming binary-variable ampl
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
$endgroup$
add a comment |
$begingroup$
I know that for some solvers, for example, the constraint programming solver in Google OR-Tools, it is possible to see all the intermediate solutions that the solver finds while it searches for an optimal solution. (An example is in this link.) I need these step-wise partial solutions to visualize the evolution of the optimization process in a physical example where I have a nonlinear 0-1 integer problem that I programmed in AMPL.
My questions are:
When solving nonlinear 0-1 integer problems, is it logical to consider such intermediate solutions?
Is it possible to obtain the intermediate solutions of solvers using AMPL? Which solvers have such a feature for AMPL?
integer-programming solver nonlinear-programming binary-variable ampl
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
$endgroup$
add a comment |
$begingroup$
I know that for some solvers, for example, the constraint programming solver in Google OR-Tools, it is possible to see all the intermediate solutions that the solver finds while it searches for an optimal solution. (An example is in this link.) I need these step-wise partial solutions to visualize the evolution of the optimization process in a physical example where I have a nonlinear 0-1 integer problem that I programmed in AMPL.
My questions are:
When solving nonlinear 0-1 integer problems, is it logical to consider such intermediate solutions?
Is it possible to obtain the intermediate solutions of solvers using AMPL? Which solvers have such a feature for AMPL?
integer-programming solver nonlinear-programming binary-variable ampl
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
$endgroup$
I know that for some solvers, for example, the constraint programming solver in Google OR-Tools, it is possible to see all the intermediate solutions that the solver finds while it searches for an optimal solution. (An example is in this link.) I need these step-wise partial solutions to visualize the evolution of the optimization process in a physical example where I have a nonlinear 0-1 integer problem that I programmed in AMPL.
My questions are:
When solving nonlinear 0-1 integer problems, is it logical to consider such intermediate solutions?
Is it possible to obtain the intermediate solutions of solvers using AMPL? Which solvers have such a feature for AMPL?
integer-programming solver nonlinear-programming binary-variable ampl
integer-programming solver nonlinear-programming binary-variable ampl
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
edited 4 hours ago
LarrySnyder610♦
5,71714 silver badges64 bronze badges
5,71714 silver badges64 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
asked 8 hours ago
Oguz ToragayOguz Toragay
2,5352 silver badges28 bronze badges
2,5352 silver badges28 bronze badges
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes it is reasonable. For problems where closing the optimality gap is difficult, you may want to save e.g. the 10 best solutions found before termination. This is called a solution pool and it is a solver specific option that you must pass to the solver from AMPL (check the solvers' manuals for "solution pool").
Most linear solvers support this (including CPLEX and GUROBI) - as for NLP solvers I believe that BARON supports this as well.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "700"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2for.stackexchange.com%2fquestions%2f1369%2fobtaining-the-intermediate-solutions-in-ampl%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$
Yes it is reasonable. For problems where closing the optimality gap is difficult, you may want to save e.g. the 10 best solutions found before termination. This is called a solution pool and it is a solver specific option that you must pass to the solver from AMPL (check the solvers' manuals for "solution pool").
Most linear solvers support this (including CPLEX and GUROBI) - as for NLP solvers I believe that BARON supports this as well.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
add a comment |
$begingroup$
Yes it is reasonable. For problems where closing the optimality gap is difficult, you may want to save e.g. the 10 best solutions found before termination. This is called a solution pool and it is a solver specific option that you must pass to the solver from AMPL (check the solvers' manuals for "solution pool").
Most linear solvers support this (including CPLEX and GUROBI) - as for NLP solvers I believe that BARON supports this as well.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
add a comment |
$begingroup$
Yes it is reasonable. For problems where closing the optimality gap is difficult, you may want to save e.g. the 10 best solutions found before termination. This is called a solution pool and it is a solver specific option that you must pass to the solver from AMPL (check the solvers' manuals for "solution pool").
Most linear solvers support this (including CPLEX and GUROBI) - as for NLP solvers I believe that BARON supports this as well.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Yes it is reasonable. For problems where closing the optimality gap is difficult, you may want to save e.g. the 10 best solutions found before termination. This is called a solution pool and it is a solver specific option that you must pass to the solver from AMPL (check the solvers' manuals for "solution pool").
Most linear solvers support this (including CPLEX and GUROBI) - as for NLP solvers I believe that BARON supports this as well.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 6 hours ago
nikazanikaza
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 6 hours ago
nikazanikaza
3994 bronze badges
answered 6 hours ago
nikazanikaza
3994 bronze badges
3994 bronze badges
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
nikaza is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
add a comment |
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
1
1
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
$begingroup$
Thank you very much for your helpful answer. I looked at BARON's user manual and found very useful information about ''solution pool".
$endgroup$
– Oguz Toragay
5 hours ago
add a comment |
Thanks for contributing an answer to Operations Research 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%2for.stackexchange.com%2fquestions%2f1369%2fobtaining-the-intermediate-solutions-in-ampl%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
