Search Results for ""
31 - 40 of 420 for Nonlinear ProgrammingSearch Results
Differential algebra is a field of mathematics that attempts to use methods from abstract algebra to study solutions of systems of polynomial nonlinear ordinary and partial ...
The Einstein field equations are the 16 coupled hyperbolic-elliptic nonlinear partial differential equations that describe the gravitational effects produced by a given mass ...
Quantization is a nonlinear process which generates additional frequency components (Thompson et al. 1986). This means that the signal is no longer band-limited, so the ...
A program initiated by F. Klein in an 1872 lecture to describe geometric structures in terms of their automorphism groups.
Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...
A set of sample problems in unconstrained optimization is given by loading Optimization`UnconstrainedProblems` and evaluating $FindMinimumProblems.
Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...
Noncommutative topology is a recent program having important and deep applications in several branches of mathematics and mathematical physics. Because every commutative ...
A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...
The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...
...
View search results from all Wolfram sites (158587 matches)

