Advertisement

Optimal Choice of a Penalty Function: Simplest Case of Algorithm Design

  • Hung T. Nguyen
  • Vladik Kreinovich
Chapter
Part of the Theory and Decision Library book series (TDLB, volume 38)

Abstract

In the previous lessons, we learned how continuous mathematics is useful in choosing and debugging the existing algorithms and programs. With this lesson, we will start learning how continuous mathematics can be useful in designing new algorithms. We will consider the simplest case of design problems, in which both the constraints and the objective are well defined and described by differentiable functions. For such problem, we describe the penalty function method, and then formulate and solve the problem of choosing the best penalty function.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Hung T. Nguyen
    • 1
  • Vladik Kreinovich
    • 2
  1. 1.New Mexico State UniversityLas CrucesUSA
  2. 2.University of Texas El PasoEl PasoUSA

Personalised recommendations