To introduce Optimization‐Preserving‐Operators (O‐P‐Os), which are operators that are defined on classes of real functions that depend on a single variable, and allow us to eliminate local optima and to preserve global optima.
Outline a new method to build O‐P‐Os. These are introduced as O‐P‐O* and lead to a new approach for solving global optimization problems.
It was found that classical discretization methods for obtaining optimum of one variable function was too time‐consuming. The simple method introduced provided solutions to the test functions chosen as examples. The solutions were provided in a short time.
Provides new tools for mathematical programming and in particular the global optimization problems. The O‐P‐O* introduced innovative technique for solving such problems.
O‐P‐O* produces solutions to global optimization problems in a much improved time. The algorithm derived, and the steps for its operation proved on implementation, the efficiency of the new method. This was demonstrated by numerical results for selected functions obtained using microcomputer systems.
Provides new way of solving global optimization problems.
