Hybrid computation in mathematical programming |
| |
Authors: | L. Dekker |
| |
Affiliation: | (1) Technological University, Delft, The Netherlands |
| |
Abstract: | It is shown that hybrid computation facilitates the solving of problems in the field of mathematical programming. First, the most important features of hybrid computation are discussed. The main part of the paper deals with examples of computational methods in which hybrid computation can be applied succesfully. The main concentration is on constrained static parameter optimization, where for brevity only penalty function techniques are considered. The use of a penalty function having an extra parameter is discussed rather extensively. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|