Ordering in lists. Here is a list of numbers. This gives the elements of t in sorted order.

Exact global optimization problems can be solved exactly using Minimize and Maximize. This computes the radius of the circle, centered at the origin, circumscribed about the ...

GraphLayout is an option to Graph and related functions that specifies what layout to use for graph components and collections of components.

Polynomial algorithms are at the core of classical "computer algebra". Incorporating methods that span from antiquity to the latest cutting-edge research at Wolfram Research, ...

x >= y or x >= y yields True if x is determined to be greater than or equal to y. x_1 >= x_2 >= x_3 yields True if the x_i form a non-increasing sequence.

x <= y or x <= y yields True if x is determined to be less than or equal to y. x_1 <= x_2 <= x_3 yields True if the x TraditionalForm\`i form a nondecreasing sequence.

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...

NthPair[n] returns the n\[Null]^th unordered pair of distinct positive integers, when sequenced to minimize the size of the larger integer. Pairs that have the same larger ...

Mathematica provides a complete set of functions needed to compute and verify the controllability and observability properties of linear systems, as well as advanced ...

NMaximize[f, x] maximizes f numerically with respect to x.NMaximize[f, {x, y, ...}] maximizes f numerically with respect to x, y, .... NMaximize[{f, cons}, {x, y, ...}] ...