TY - RPRT
A1 - Winterfeld, A.
T1 - Application of general semi-infinite Programming to Lapidary Cutting Problems
N2 - We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of container constraints, which is necessary to make the subproblems practically tractable. An iterative process consisting of GSIP optimization and adaptive refinement steps is then employed to obtain an optimal solution which is also feasible for the original problem. Some numerical results based on realworld data are also presented.
T3 - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 91
KW - large scale optimization
KW - nonlinear programming
KW - general semi-infinite optimization
KW - design centering
KW - clustering
KW - large scale optimization
KW - nonlinear programming
KW - general semi-infinite optimization
KW - design centering
KW - clustering
Y1 - 2006
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1746
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-14342
ER -