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

EffectiveInterest[r, q] gives the effective interest rate corresponding to interest specification r, compounded at time intervals q.

PseudoInverse[m] finds the pseudoinverse of a rectangular matrix.

RootReduce[expr] attempts to reduce expr to a single Root object.

ForAll[x, expr] represents the statement that expr is True for all values of x. ForAll[x, cond, expr] states that expr is True for all x satisfying the condition cond. ...

All the functionality of NumericalMath`EquationTrekker` is now available in the newly created Equation Trekker Package.

FullSimplify[expr] tries a wide range of transformations on expr involving elementary and special functions, and returns the simplest form it finds. FullSimplify[expr, assum] ...

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

Version 6.0 represented a major step forward in visualization and graphics, with many new and original concepts. Among them was full integration of Mathematica symbolic ...

Building on Mathematica's unique base of visualization and graphics capabilities, Mathematica 7 adds several important new areas. Emphasizing integration and automation, ...