@brian bovril You wrote:

• I think your problem is likely non-linear...

Why do you think so? My experience with logistics problems, which is probably less than yours, is that they are usually either LP, ILP, or intractable/combinatorial (NP-complete or NP-hard) such as the classic travelling salesman problem. I don't recall seeing many that are classic NLP, i.e. nonlinear with differentiable objective and constraints.

@ Yes, this is because the command

Y:= Matrix((m,n), symbol= y);

creates a Matrix filled with variables y[i,j], 1 <= i <= m, 1 <= j <= n. It is not necessary that the symbol be the lowercase of Matrix's name, but I usually do it that way to avoid confusion. Once the Matrix has been created thus, it can be used for matrix multiplication, and the final answer can be compactly stated by evaling the Matrix over the solution.

You should use userinfo instead of print: It gives you finer control over the format, and you can turn it on and off externally. Once a program is instrumented with userinfo statements for debugging, they'll never need to be removed. 

Egads, that's horrible. The command should be simply deleted ASAP until it can be replaced by a competent command. This crap serves no useful purpose in this state, and it's doing more harm than good. Not only does it give the wrong idea about limits, it also gives the wrong idea about symbolic computation. Perhaps Maplesoft should have a review panel of professional educators, and any "tutor" would need to be approved by them before being released . 

A vote up for your muck-raking efforts. 

@Kitonum The function to be plotted doesn't need to be a procedure if you nullify the true labels by including the option labels= [``$3] in the plot3d command.

@Muhammad Usman Use the three-argument form of coeff:

for i from 0 to Equation do
   C[i]:= coeff(u, x, i) = coeff(f, x, i)
end do:

@umar khan There are no real values of r such that v is also real.

@Joe Riel There's also ArrayTools:-IsZero.

The index spec in the rtable_scanblock command can be shortened to [i, ..].

@vv I modifed the code for the animation so that the memory usage is only 20M.

@Christopher2222 No, is won't work in this case. AFAIK, there are no cases where the default boolean evaluator returns a truefalse result and is returns a different result. Sometimes is can make finer distinctions in cases where the default evaluator returns an ambiguous result. That's not the case here: The default evaluator returns false because the addresses of the vectors are different; it couldn't care less about the contents of the vectors---it only checks addresses. The situation would be different if one were comparing lists rather than vectors. The evaluator still just checks addresses, but because of the way that Maple stores lists, lists that are equal are necessarily stored at the same address. How's that? When new lists (and many other structures) are created, they are compared against existing lists for matches in a part of Maple called the "simplification table." (See the "Simplification Table" section in Appendix A of the Maple Programming Guide.) That's part of the reason why it's inefficient to iteratively lenghten lists (or sequences, or sets).

@student_md You wrote:

• limit(sum(diff(Fn,Xn)*Xn,n=1..N),N=infinity)

If this expression makes sense at all, then it's equivalent to

sum(diff(F[n], X[n])*X[n], n= 1..infinity);

But I think that having an infinite number of X's is quite odd.

@umar khan You say that you want to "iterate" P(r) to find the root. That type of low-level operation is usually not necessary in Maple. The main command for finding roots is fsolve. It does the iterating in the background.

@Preben Alsholm I'm using Digits = 15. Is that perhaps the cause of the difference?

@Axel Vogt Symbolic dsolve automatically converts floats to fractions unless you explicitly tell it not to by using option convert_to_exact= false.

There is no attachment to your Question.