A CLASS OF INVERSE THEOREMS ON RECURSIVE PROGRAMMING WITH MONOTONICITY

スポンサーリンク

概要

• 論文の詳細を見る

• The author gives a broad class of inverse theorems on mathematical programming problems, where the objective function is either a recursive function with strict increasingness or a recursive function with strict decreasing-ness, and so is the constraint function. It is also shown that the optimal-value functions of main and inverse problems can be expressed by the successive use of some nonlinear operators defined in this paper. Each expression is based upon either Bellman's Principle of Optimality or its modified principle. Further each inverse theorem accompanies an example.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Iwamoto Seiichi

  Department Of Economic Engineering Graduate School Of Economics Kyushu University

• Iwamoto Seiichi

  Department Of Economic Engineering Faculty Of Economics Kyushu University

• Iwamoto Seiichi

  Department Of Mathematics Faculty Of Science Kyushu University

関連論文

• The Golden Trinity : Optimality, Inequality and Identity(Mathematical Economics)
• On Golden inequalities(The Development of Information and Decision Processes)
• STOCHASTIC DECISION-MAKING IN A FUZZY ENVIRONMENT
• A CLASS OF INVERSE THEOREMS ON RECURSIVE PROGRAMMING WITH MONOTONICITY

スポンサーリンク