Documente Academic
Documente Profesional
Documente Cultură
Abstract
1 Introduction
solve. It was proved on some numerical examples that the OA/ER algorithm
requires much fewer major iteration than the NBB, ECP or GBD methods.
The OA/ER algorithm consists of solving an alternative sequence of NLP
and MIL? master problem optimization subproblems. The former corresponds
to the optimization of parameters for a mechanical structure with fixed
structure topology and standard dimensions and yields an upper bound to the
objective to be minimized. The latter involves a global approximation to the
superstructure of alternatives in which a new topology and standard
dimensions are identified so that its lower bound does not exceed the current
best upper bound. The search is terminated when the predicted lower bound
exceeds the upper bound.
The OA/ER algorithm as well as all other mentioned MINLP algorithms
do not generally guarantee that the solution found is the global optimum. This
is due to the presence of nonconvex functions in the models that may cut off
the global optimum. In order to reduce undesirable effects of nonconvexities
the Modified OA/ER algorithm was proposed by Kravanja and Grossmann[l]
by which the following modifications can been applied for the master
problem:
• deactivation of linearizations,
• decomposition and deactivation of the objective function linearization,
• use of the penalty function,
• use of the upper bound on the objective function to be maximized, and
• global convexity test and validation of the outer approximations.
discrete variables are included in the first NLP subproblem and 2032
equations with 1764 continuous and 54 discrete variables are included in the
MILP master problem at which the optimal solution was found. Only 293
seconds of the CPU time on the computer VAX 4100 were spent.
\LLLL IJL-lLli-L
r 1
2900 a) 2921 b)
2400 2490
-r \I
8200 mm -8200mm-
u i i i i i i 1 1 1
6 Conclusions
References