A new solution to optimization-satisfaction problems by a penalty method

Kiyotaka Shimizu, Eitaro Aiyoshi

研究成果: Article査読

1 被引用数 (Scopus)

抄録

This paper is concerned with an optimization-satisfaction problem to determine an optimal solution such that a certain objective function is minimized, subject to satisfaction conditions against uncertainties of any disturbances or opponents' decisions. Such satisfaction conditions require that plural performance criteria are always less than specified values against any disturbances or opponents' decisions. Therefore, this problem is formulated as a minimization problem with the constraints which include max operations with respect to the disturbances or the opponents' decision variables. A new computational method is proposed in which a series of approximate problems transformed by applying a penalty function method to the max operations within the satisfaction conditions are solved by usual nonlinear programming. It is proved that a sequence of approximated solutions converges to a true optimal solution. The proposed algorithm may be useful for systems design under unknown parameters, process control under uncertainties, general approximation theory, and strategic weapons allocation problems.

本文言語English
ページ(範囲)37-46
ページ数10
ジャーナルAutomatica
18
1
DOI
出版ステータスPublished - 1982 1

ASJC Scopus subject areas

  • 制御およびシステム工学
  • 電子工学および電気工学

フィンガープリント

「A new solution to optimization-satisfaction problems by a penalty method」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル