NMaximize is not converging to a solutionDeclaration of variables in large Linear Programming model with NMaximizeHow trustworthy is NMaximize?Numeric range: present or notMaximalBy[#, “votes”] & not equal to MaximalBy[“votes”]?Maximimize not working properly?Does fitting data get stuck by non-homogeneous interval of data?How to find maximum (not with numbers,but with parameters) of 2-variables function under constraints?Hot to single out numeric values from NMaximizeNSum: Summand (or its derivative) is not numerical at pointProblem with constraints of NMaximize

How does quantile regression compare to logistic regression with the variable split at the quantile?

How do I gain back my faith in my PhD degree?

How can I make my BBEG immortal short of making them a Lich or Vampire?

What is a clear way to write a bar that has an extra beat?

How to efficiently unroll a matrix by value with numpy?

What's that red-plus icon near a text?

Can you really stack all of this on an Opportunity Attack?

What do the dots in this tr command do: tr .............A-Z A-ZA-Z <<< "JVPQBOV" (with 13 dots)

Perform and show arithmetic with LuaLaTeX

Can I ask the recruiters in my resume to put the reason why I am rejected?

How can bays and straits be determined in a procedurally generated map?

Could an aircraft fly or hover using only jets of compressed air?

How can I prevent hyper evolved versions of regular creatures from wiping out their cousins?

Why do I get two different answers for this counting problem?

tikz convert color string to hex value

Why doesn't H₄O²⁺ exist?

What does "Puller Prush Person" mean?

Is it legal for company to use my work email to pretend I still work there?

What would happen to a modern skyscraper if it rains micro blackholes?

Which country benefited the most from UN Security Council vetoes?

How does one intimidate enemies without having the capacity for violence?

Do infinite dimensional systems make sense?

Fully-Firstable Anagram Sets

LWC SFDX source push error TypeError: LWC1009: decl.moveTo is not a function



NMaximize is not converging to a solution


Declaration of variables in large Linear Programming model with NMaximizeHow trustworthy is NMaximize?Numeric range: present or notMaximalBy[#, “votes”] & not equal to MaximalBy[“votes”]?Maximimize not working properly?Does fitting data get stuck by non-homogeneous interval of data?How to find maximum (not with numbers,but with parameters) of 2-variables function under constraints?Hot to single out numeric values from NMaximizeNSum: Summand (or its derivative) is not numerical at pointProblem with constraints of NMaximize













3












$begingroup$


I am trying to use NMaximize to find the maximum value of a variable that satisfies the given constraints. Since the constraints aren't straightforward, I am using the function.



I can see the constraints are such that the value is bounded but I get the below warning messages:




NMaximize::cvmit: Failed to converge to the requested accuracy or
precision within 100000 iterations.



NMaximize::cvdiv: Failed to
converge to a solution. The function may be unbounded.




The constraint and the way I am using the function is as below:



 constraint = (x | y) [Element] 
Integers && ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. &&
0 <= y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x -
3.63201*10^84 x^2]) || (10713. <= x <= 19762. &&
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2] < y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2]))


maxX =
NMaximize[x, constraint, x, y, MaxIterations -> 100000]


I have increased the MaxIterations from 100 to 100000 but it doesn't seem to converge. I am not sure if increasing the MaxIterations is the solution. Can you please guide me with this?










share|improve this question









$endgroup$











  • $begingroup$
    Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
    $endgroup$
    – Daniel Lichtblau
    13 hours ago






  • 1




    $begingroup$
    I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
    $endgroup$
    – JimB
    12 hours ago











  • $begingroup$
    @JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
    $endgroup$
    – gaganso
    12 hours ago










  • $begingroup$
    Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
    $endgroup$
    – JimB
    12 hours ago







  • 1




    $begingroup$
    OK. I was assuming that you were conditioning on the maximum value of $x$.
    $endgroup$
    – JimB
    11 hours ago















3












$begingroup$


I am trying to use NMaximize to find the maximum value of a variable that satisfies the given constraints. Since the constraints aren't straightforward, I am using the function.



I can see the constraints are such that the value is bounded but I get the below warning messages:




NMaximize::cvmit: Failed to converge to the requested accuracy or
precision within 100000 iterations.



NMaximize::cvdiv: Failed to
converge to a solution. The function may be unbounded.




The constraint and the way I am using the function is as below:



 constraint = (x | y) [Element] 
Integers && ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. &&
0 <= y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x -
3.63201*10^84 x^2]) || (10713. <= x <= 19762. &&
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2] < y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2]))


maxX =
NMaximize[x, constraint, x, y, MaxIterations -> 100000]


I have increased the MaxIterations from 100 to 100000 but it doesn't seem to converge. I am not sure if increasing the MaxIterations is the solution. Can you please guide me with this?










share|improve this question









$endgroup$











  • $begingroup$
    Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
    $endgroup$
    – Daniel Lichtblau
    13 hours ago






  • 1




    $begingroup$
    I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
    $endgroup$
    – JimB
    12 hours ago











  • $begingroup$
    @JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
    $endgroup$
    – gaganso
    12 hours ago










  • $begingroup$
    Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
    $endgroup$
    – JimB
    12 hours ago







  • 1




    $begingroup$
    OK. I was assuming that you were conditioning on the maximum value of $x$.
    $endgroup$
    – JimB
    11 hours ago













3












3








3





$begingroup$


I am trying to use NMaximize to find the maximum value of a variable that satisfies the given constraints. Since the constraints aren't straightforward, I am using the function.



I can see the constraints are such that the value is bounded but I get the below warning messages:




NMaximize::cvmit: Failed to converge to the requested accuracy or
precision within 100000 iterations.



NMaximize::cvdiv: Failed to
converge to a solution. The function may be unbounded.




The constraint and the way I am using the function is as below:



 constraint = (x | y) [Element] 
Integers && ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. &&
0 <= y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x -
3.63201*10^84 x^2]) || (10713. <= x <= 19762. &&
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2] < y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2]))


maxX =
NMaximize[x, constraint, x, y, MaxIterations -> 100000]


I have increased the MaxIterations from 100 to 100000 but it doesn't seem to converge. I am not sure if increasing the MaxIterations is the solution. Can you please guide me with this?










share|improve this question









$endgroup$




I am trying to use NMaximize to find the maximum value of a variable that satisfies the given constraints. Since the constraints aren't straightforward, I am using the function.



I can see the constraints are such that the value is bounded but I get the below warning messages:




NMaximize::cvmit: Failed to converge to the requested accuracy or
precision within 100000 iterations.



NMaximize::cvdiv: Failed to
converge to a solution. The function may be unbounded.




The constraint and the way I am using the function is as below:



 constraint = (x | y) [Element] 
Integers && ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. &&
0 <= y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x -
3.63201*10^84 x^2]) || (10713. <= x <= 19762. &&
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2] < y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-43 Sqrt[
4.98614*10^92 + 4.65469*10^88 x - 3.63201*10^84 x^2]))


maxX =
NMaximize[x, constraint, x, y, MaxIterations -> 100000]


I have increased the MaxIterations from 100 to 100000 but it doesn't seem to converge. I am not sure if increasing the MaxIterations is the solution. Can you please guide me with this?







functions maximum






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 13 hours ago









gagansogaganso

1528




1528











  • $begingroup$
    Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
    $endgroup$
    – Daniel Lichtblau
    13 hours ago






  • 1




    $begingroup$
    I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
    $endgroup$
    – JimB
    12 hours ago











  • $begingroup$
    @JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
    $endgroup$
    – gaganso
    12 hours ago










  • $begingroup$
    Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
    $endgroup$
    – JimB
    12 hours ago







  • 1




    $begingroup$
    OK. I was assuming that you were conditioning on the maximum value of $x$.
    $endgroup$
    – JimB
    11 hours ago
















  • $begingroup$
    Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
    $endgroup$
    – Daniel Lichtblau
    13 hours ago






  • 1




    $begingroup$
    I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
    $endgroup$
    – JimB
    12 hours ago











  • $begingroup$
    @JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
    $endgroup$
    – gaganso
    12 hours ago










  • $begingroup$
    Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
    $endgroup$
    – JimB
    12 hours ago







  • 1




    $begingroup$
    OK. I was assuming that you were conditioning on the maximum value of $x$.
    $endgroup$
    – JimB
    11 hours ago















$begingroup$
Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
$endgroup$
– Daniel Lichtblau
13 hours ago




$begingroup$
Could try maximizing over individual regions of the piecewise set-up. But the machine precision values will make validation of inequalities kind of iffy.
$endgroup$
– Daniel Lichtblau
13 hours ago




1




1




$begingroup$
I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
$endgroup$
– JimB
12 hours ago





$begingroup$
I'm not seeing what $y$ has to do with this. Wouldn't the maximum value of $x$ be 19762? constraint /. x -> 19762 results in y [Element] Integers && 7229.16 < y < 7344.29 and constraint /. x -> 19763 results in False.
$endgroup$
– JimB
12 hours ago













$begingroup$
@JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
$endgroup$
– gaganso
12 hours ago




$begingroup$
@JimB, I think for x, y isn't needed. Thanks for pointing this out. But if I am trying to maximize y, I need to maximize over both the variables since y is an expression of x, right?
$endgroup$
– gaganso
12 hours ago












$begingroup$
Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
$endgroup$
– JimB
12 hours ago





$begingroup$
Yes, if that's what you want. The general solution appears to be $x = 19762$ and $7230leq y leq 7344$. So to maximize $y$ you'd choose $7344$.
$endgroup$
– JimB
12 hours ago





1




1




$begingroup$
OK. I was assuming that you were conditioning on the maximum value of $x$.
$endgroup$
– JimB
11 hours ago




$begingroup$
OK. I was assuming that you were conditioning on the maximum value of $x$.
$endgroup$
– JimB
11 hours ago










2 Answers
2






active

oldest

votes


















5












$begingroup$

Rationalize the constraint:



constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
0 <= y < 2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-1 Sqrt[
4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <= x <=
19762. &&
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) //
Rationalize[#, 0] & // Simplify;


With the Rationalized constraint you can use Maximize:



maxX = Maximize[x, constraint2, x, y]

(* 19762, x -> 19762, y -> 7287 *)

constraint2 /. maxX[[2]]

(* True *)


EDIT: To find maximum y



(maxY = Maximize[y, constraint2, x, y]) // N


enter image description here



To plot the region defined by the constraint:



reg = ImplicitRegion[constraint2, x, y];

Region[reg,
Frame -> True,
FrameLabel -> (Style[#, 12, Bold] & /@ x, y),
Epilog -> Red,
AbsolutePointSize[3],
Point[x, y /. maxX[[2]]],
Point[x, y /. maxY[[2]]]]


enter image description here






share|improve this answer











$endgroup$




















    3












    $begingroup$

    You have numbers spread a wide range of magnitudes for no good reason. This range is probably too wide for machine precision arithmetic. Also telling NMinimize explicitly that this an integer optimization problem seems to help. Try this:



    constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
    0 <= y <
    2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
    2.8484*10^-1 Sqrt[
    4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <=
    x <= 19762. &&
    2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
    2.8484*10^-1 Sqrt[
    4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
    2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
    2.8484*10^-1 Sqrt[
    4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) // Expand

    maxX = NMaximize[x, constraint2, x, y, Integers,
    MaxIterations -> 10000]



    19762., x -> 19762, y -> 7311




    And with your definition of constraint:



    constraint /. maxX[[2]]



    True







    share|improve this answer











    $endgroup$












    • $begingroup$
      But constraint /. x -> 19762 /. y -> 8647 results in False?
      $endgroup$
      – JimB
      12 hours ago










    • $begingroup$
      @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
      $endgroup$
      – Henrik Schumacher
      12 hours ago











    • $begingroup$
      @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
      $endgroup$
      – gaganso
      12 hours ago











    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: "387"
    ;
    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
    ,
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194684%2fnmaximize-is-not-converging-to-a-solution%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    5












    $begingroup$

    Rationalize the constraint:



    constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
    0 <= y < 2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
    2.8484*10^-1 Sqrt[
    4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <= x <=
    19762. &&
    2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
    2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
    2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
    2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) //
    Rationalize[#, 0] & // Simplify;


    With the Rationalized constraint you can use Maximize:



    maxX = Maximize[x, constraint2, x, y]

    (* 19762, x -> 19762, y -> 7287 *)

    constraint2 /. maxX[[2]]

    (* True *)


    EDIT: To find maximum y



    (maxY = Maximize[y, constraint2, x, y]) // N


    enter image description here



    To plot the region defined by the constraint:



    reg = ImplicitRegion[constraint2, x, y];

    Region[reg,
    Frame -> True,
    FrameLabel -> (Style[#, 12, Bold] & /@ x, y),
    Epilog -> Red,
    AbsolutePointSize[3],
    Point[x, y /. maxX[[2]]],
    Point[x, y /. maxY[[2]]]]


    enter image description here






    share|improve this answer











    $endgroup$

















      5












      $begingroup$

      Rationalize the constraint:



      constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
      0 <= y < 2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
      2.8484*10^-1 Sqrt[
      4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <= x <=
      19762. &&
      2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
      2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
      2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
      2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) //
      Rationalize[#, 0] & // Simplify;


      With the Rationalized constraint you can use Maximize:



      maxX = Maximize[x, constraint2, x, y]

      (* 19762, x -> 19762, y -> 7287 *)

      constraint2 /. maxX[[2]]

      (* True *)


      EDIT: To find maximum y



      (maxY = Maximize[y, constraint2, x, y]) // N


      enter image description here



      To plot the region defined by the constraint:



      reg = ImplicitRegion[constraint2, x, y];

      Region[reg,
      Frame -> True,
      FrameLabel -> (Style[#, 12, Bold] & /@ x, y),
      Epilog -> Red,
      AbsolutePointSize[3],
      Point[x, y /. maxX[[2]]],
      Point[x, y /. maxY[[2]]]]


      enter image description here






      share|improve this answer











      $endgroup$















        5












        5








        5





        $begingroup$

        Rationalize the constraint:



        constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
        0 <= y < 2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
        2.8484*10^-1 Sqrt[
        4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <= x <=
        19762. &&
        2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
        2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
        2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
        2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) //
        Rationalize[#, 0] & // Simplify;


        With the Rationalized constraint you can use Maximize:



        maxX = Maximize[x, constraint2, x, y]

        (* 19762, x -> 19762, y -> 7287 *)

        constraint2 /. maxX[[2]]

        (* True *)


        EDIT: To find maximum y



        (maxY = Maximize[y, constraint2, x, y]) // N


        enter image description here



        To plot the region defined by the constraint:



        reg = ImplicitRegion[constraint2, x, y];

        Region[reg,
        Frame -> True,
        FrameLabel -> (Style[#, 12, Bold] & /@ x, y),
        Epilog -> Red,
        AbsolutePointSize[3],
        Point[x, y /. maxX[[2]]],
        Point[x, y /. maxY[[2]]]]


        enter image description here






        share|improve this answer











        $endgroup$



        Rationalize the constraint:



        constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
        0 <= y < 2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
        2.8484*10^-1 Sqrt[
        4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <= x <=
        19762. &&
        2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
        2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
        2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
        2.8484*10^-1 Sqrt[4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) //
        Rationalize[#, 0] & // Simplify;


        With the Rationalized constraint you can use Maximize:



        maxX = Maximize[x, constraint2, x, y]

        (* 19762, x -> 19762, y -> 7287 *)

        constraint2 /. maxX[[2]]

        (* True *)


        EDIT: To find maximum y



        (maxY = Maximize[y, constraint2, x, y]) // N


        enter image description here



        To plot the region defined by the constraint:



        reg = ImplicitRegion[constraint2, x, y];

        Region[reg,
        Frame -> True,
        FrameLabel -> (Style[#, 12, Bold] & /@ x, y),
        Epilog -> Red,
        AbsolutePointSize[3],
        Point[x, y /. maxX[[2]]],
        Point[x, y /. maxY[[2]]]]


        enter image description here







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 11 hours ago

























        answered 11 hours ago









        Bob HanlonBob Hanlon

        61.4k33598




        61.4k33598





















            3












            $begingroup$

            You have numbers spread a wide range of magnitudes for no good reason. This range is probably too wide for machine precision arithmetic. Also telling NMinimize explicitly that this an integer optimization problem seems to help. Try this:



            constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
            0 <= y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <=
            x <= 19762. &&
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) // Expand

            maxX = NMaximize[x, constraint2, x, y, Integers,
            MaxIterations -> 10000]



            19762., x -> 19762, y -> 7311




            And with your definition of constraint:



            constraint /. maxX[[2]]



            True







            share|improve this answer











            $endgroup$












            • $begingroup$
              But constraint /. x -> 19762 /. y -> 8647 results in False?
              $endgroup$
              – JimB
              12 hours ago










            • $begingroup$
              @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
              $endgroup$
              – Henrik Schumacher
              12 hours ago











            • $begingroup$
              @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
              $endgroup$
              – gaganso
              12 hours ago















            3












            $begingroup$

            You have numbers spread a wide range of magnitudes for no good reason. This range is probably too wide for machine precision arithmetic. Also telling NMinimize explicitly that this an integer optimization problem seems to help. Try this:



            constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
            0 <= y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <=
            x <= 19762. &&
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) // Expand

            maxX = NMaximize[x, constraint2, x, y, Integers,
            MaxIterations -> 10000]



            19762., x -> 19762, y -> 7311




            And with your definition of constraint:



            constraint /. maxX[[2]]



            True







            share|improve this answer











            $endgroup$












            • $begingroup$
              But constraint /. x -> 19762 /. y -> 8647 results in False?
              $endgroup$
              – JimB
              12 hours ago










            • $begingroup$
              @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
              $endgroup$
              – Henrik Schumacher
              12 hours ago











            • $begingroup$
              @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
              $endgroup$
              – gaganso
              12 hours ago













            3












            3








            3





            $begingroup$

            You have numbers spread a wide range of magnitudes for no good reason. This range is probably too wide for machine precision arithmetic. Also telling NMinimize explicitly that this an integer optimization problem seems to help. Try this:



            constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
            0 <= y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <=
            x <= 19762. &&
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) // Expand

            maxX = NMaximize[x, constraint2, x, y, Integers,
            MaxIterations -> 10000]



            19762., x -> 19762, y -> 7311




            And with your definition of constraint:



            constraint /. maxX[[2]]



            True







            share|improve this answer











            $endgroup$



            You have numbers spread a wide range of magnitudes for no good reason. This range is probably too wide for machine precision arithmetic. Also telling NMinimize explicitly that this an integer optimization problem seems to help. Try this:



            constraint2 = ((x == 0 && 1. <= y <= 12720.) || (1. <= x <= 10712. && 
            0 <= y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2]) || (10713. <=
            x <= 19762. &&
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) -
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2] < y <
            2.08565*10^-36 (3.04959*10^39 + 2.24751*10^34 x) +
            2.8484*10^-1 Sqrt[
            4.98614*10^8 + 4.65469*10^4 x - 3.63201 x^2])) // Expand

            maxX = NMaximize[x, constraint2, x, y, Integers,
            MaxIterations -> 10000]



            19762., x -> 19762, y -> 7311




            And with your definition of constraint:



            constraint /. maxX[[2]]



            True








            share|improve this answer














            share|improve this answer



            share|improve this answer








            edited 12 hours ago

























            answered 12 hours ago









            Henrik SchumacherHenrik Schumacher

            59.4k582165




            59.4k582165











            • $begingroup$
              But constraint /. x -> 19762 /. y -> 8647 results in False?
              $endgroup$
              – JimB
              12 hours ago










            • $begingroup$
              @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
              $endgroup$
              – Henrik Schumacher
              12 hours ago











            • $begingroup$
              @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
              $endgroup$
              – gaganso
              12 hours ago
















            • $begingroup$
              But constraint /. x -> 19762 /. y -> 8647 results in False?
              $endgroup$
              – JimB
              12 hours ago










            • $begingroup$
              @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
              $endgroup$
              – Henrik Schumacher
              12 hours ago











            • $begingroup$
              @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
              $endgroup$
              – gaganso
              12 hours ago















            $begingroup$
            But constraint /. x -> 19762 /. y -> 8647 results in False?
            $endgroup$
            – JimB
            12 hours ago




            $begingroup$
            But constraint /. x -> 19762 /. y -> 8647 results in False?
            $endgroup$
            – JimB
            12 hours ago












            $begingroup$
            @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
            $endgroup$
            – Henrik Schumacher
            12 hours ago





            $begingroup$
            @JimB D'oh. Yeah, I did the simplification wrong. -.- Thanks for pointing that out.
            $endgroup$
            – Henrik Schumacher
            12 hours ago













            $begingroup$
            @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
            $endgroup$
            – gaganso
            12 hours ago




            $begingroup$
            @HenrikSchumacher, thank you for this. This works for x but when I try to find the maximum y similarly, I still get the same message - NMaximize[y, res, x, y, Integers, MaxIterations -> 100000]. Output: NMaximize::cvdiv: Failed to converge to a solution. The function may be unbounded.
            $endgroup$
            – gaganso
            12 hours ago

















            draft saved

            draft discarded
















































            Thanks for contributing an answer to Mathematica 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.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194684%2fnmaximize-is-not-converging-to-a-solution%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







            Popular posts from this blog

            Reverse int within the 32-bit signed integer range: [−2^31, 2^31 − 1]Combining two 32-bit integers into one 64-bit integerDetermine if an int is within rangeLossy packing 32 bit integer to 16 bitComputing the square root of a 64-bit integerKeeping integer addition within boundsSafe multiplication of two 64-bit signed integersLeetcode 10: Regular Expression MatchingSigned integer-to-ascii x86_64 assembler macroReverse the digits of an Integer“Add two numbers given in reverse order from a linked list”

            Category:Fedor von Bock Media in category "Fedor von Bock"Navigation menuUpload mediaISNI: 0000 0000 5511 3417VIAF ID: 24712551GND ID: 119294796Library of Congress authority ID: n96068363BnF ID: 12534305fSUDOC authorities ID: 034604189Open Library ID: OL338253ANKCR AUT ID: jn19990000869National Library of Israel ID: 000514068National Thesaurus for Author Names ID: 341574317ReasonatorScholiaStatistics

            Kiel Indholdsfortegnelse Historie | Transport og færgeforbindelser | Sejlsport og anden sport | Kultur | Kendte personer fra Kiel | Noter | Litteratur | Eksterne henvisninger | Navigationsmenuwww.kiel.de54°19′31″N 10°8′26″Ø / 54.32528°N 10.14056°Ø / 54.32528; 10.14056Oberbürgermeister Dr. Ulf Kämpferwww.statistik-nord.deDen danske Stats StatistikKiels hjemmesiderrrWorldCat312794080n790547494030481-4