Mathematica provides various ways to set up conditionals, which specify that particular expressions should be evaluated only if certain conditions hold. Conditional ...

Mathematica stores preference settings and initialization data in two directories, $BaseDirectory and $UserBaseDirectory. Within each of these directories are several ...

NMinimize, NMaximize, Minimize, and Maximize employ global optimization algorithms, and are thus suitable when a global optimum is needed. Minimize and Maximize can find ...

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 ...

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

Constrained optimization problems are problems for which a function f(x) is to be minimized or maximized subject to constraints Φ(x). Here f:^n  is called the objective ...

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

Lists are widely used in Mathematica, and there are many ways to construct them. Some explicit ways to construct lists. This gives a table of the first five powers of 2.

Functions for constructing matrices. This generates a 2×2 matrix whose i,j^th entry is a[i,j]. Here is another way to produce the same matrix.

A typical package written in Mathematica introduces several new symbols intended for use outside the package. These symbols may correspond for example to new functions or new ...