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
minimizing f(x)
There exists a variety of optimization methods that can be applied to realworld 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
for functions
with a single variable (onedimensional space) and optimizations for functions with multiple variables.
For single variable function we show the Bisection Method and the
Simplex Method for multivariable functions.
Please select from the menu →
OPTIMIZATION ALGORITHMS (press to select)
