Linearization method and unsmooth optimization
Abstract
Two modifications of nonstandard application of linearization method to solve unsmooth optimization problems are considered. On the basis of its modification for solve problems of back-convex programming, there has been developed an applied programs packet called Packing. The effectiveness of the packet and its modifications is illustrated by examples of different packing and arrangement of the objects.Downloads
Published
2009-09-25
Issue
Section
Methods of optimization, optimum control and theory of games