Items tagged with minimize


Let be the number z so that |z+3-2*I| + |z-3-8*I| = 6*sqrt(2). Find min and max of the modulus of z. How can I find min and max of modulus of z with Maple.

Thank for your help!


I would like to compute the limit as t goes to +infinity of

assume(t, positive);


where delta is very small such that 1- delta is positive.

Then I would like to compute the limit as to goes to infinity of g(t)

Many thanks





Dear all

I have n, p two integers greater than one

I would like to minimize the following real number by a fixed positive constant if its possible


Many thanks

I want to plot and otherwise use the value of the parameter I'm minimizing w.r.t. Mimimize only provides me with the solution l]ike this:


ans := Minimize(dChisq);
     [-64.4156340847187, [x = HFloat(0.9455666933532977)]]


Help does not indicate how to get at the value of x which in this case I want to plot and might want to input to further calculations. Indded I don't now what to do with above ... other than I can extract the value of the 'chisq' at the minimum. But I can't get at the important number which is where the minimum is.

No way to get the uncertainty on x is evident either. I could do this myself but need to know the value at the minimum to do it.



Dear Community,

I've made a nonlinear curve fit with the Minimize routine (see attachment). What would be an easy and elegant way to rerun the model (Model) with the fitted values of a, b, c and plot the result together with the measured points in the same chart? I'm stuck here.

Tx in advance,

best regards




minimize((x+y)^2+cos(y)^2, x=-4..4, y=-2..2);  # cos(2)^2    should be 0
minimize((x+y)^2+cos(y), x=-4..4, y=-4..4);      
Error, (in unknown) mapped procedure in `ormap' must return true or false
minimize((x+y)^2+cos(y));                                   # infinity   ?!  should be -1

Edited. Corrected second example

objectiveproc := proc(mmm)
return Trace(abs(M));
end proc:
i := 0:
t := 1:

Error, (in objectiveproc) invalid subscript selector


Salut j'ai fait un programme avec maple   pour minimiser une fonction à deux variable avec la méthode de fletcher reevers car la fonction minimize ne marche pas avec les fonction plus compliqué.
SP veuillez voir mon programmme et essayer de le corriger car la boucle while ne marche pas:

Dear Maple users

In order to solve a problem in Biology, I have come across four equations with three unknowns, making it overdetermined. The equation system does not have any specific solutions, but since the equations can be considered containing errors, I am looking after the best possible solution - which will minimize the coefficients in the original equation system. My question is twofold:

1. Does there exist a specific Mathematical Theory to handle non-linear equation systems of this type?

2. Which command in Maple can solve it?






I've got this huge chunk of code which leads to an optimiazation at the very last line (Bestangles:=minimize(maximize()-minimize))). This minization is taking a very long time (havent solved it yet) and I would very much like to reduce that time. As I've understood maple does optimization by differentiating and then finding all extremes and comparing. Would this mean that since I minimize and optimize within a minimization command, it differentiates a ton of times? And if this is the case, can I somehow do the differentiation beforehand, since it is the same function being differentiate all the time? Or is there some other way I can improve the code? 
Thanks alot!

Heres the full code:

Hi all

Assume that we have a cost functional, namely J, which we want to be minimized but we have to set of constraint CC1 and CC2.

what should we do it?

The code which I have written is attached(Minimize J under CC1[i]=0 and CC2[i]=0)

 any suggestion or guide is praiseworthy.

Thanks in advance


Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department



Population at point A is 500. Point B 200. See pics.

where is the best point to meet such that the total distance is minimized. Can only go "taxi way", no diagonals allowed.

[the answer is (5,5).

Solution given: sumPop/2=~7 units. Left-right sum7 occurs at C, x=5. Bottom-top sum7 occurs at B, y=5].

there must be a better (Maple) way...

So i got a procedure test, she is kind of numeric, i whant to optimaze test([.5, .5, .5], 1, 3, 100, 100, true, [x, 0, 0, 0, 0])=0 by x. But optinization substitutes x like a symbol, i tryed all methods but they all do the same.

f := proc (x) options operator, arrow; abs(test([.5, .5, .5], 1, 3, 100, 100, true, [x, 0, 0, 0, 0])-.4) end proc; Minimize(f(x));
Error, (in test) cannot determine if this expression is true or false: 0 < -43.0+100*x

Can i some how use optinization on such procedure?

file link  - >

1 2 3 Page 1 of 3