Optimization is often used to find values of variables that yield a minimum or maximum function value. It usually
considers the problem of minimization because maximization of f(x) can be achieved by simply
There exists a variety of optimization methods that can be applied to real-world engineering problems. These type of algorithms
are iterative in nature that require starting values for the variables.
There are various techniques for the solution of optimization problems. At KMP we developed algorithms applicable
with a single variable (one-dimensional space) and optimizations for functions with multiple variables.
For single variable function we show the Bisection Method and the
Simplex Method for multi-variable functions.
Please select from the menu →
PRESS TO SELECT