摘要
本文对规划论的求解进行研究,特别对不可微规划进行了讨论和研究,得出了对一些特殊不可 微规划的求解方法.将一类特殊的不可微规划转化为经典的可微规划进行求解。最后以多寡头的合作竞争博 弈均衡求解为例,对特殊的不可微规划进行求解。
This paper discussed the solution issues in programming especially when the programming is nondifferentiable. It provides a method by transforming a specific non-differentiable programming into classical differentiable one and also gives an example to demonstrate in the equilibrium in coopetition game.
出处
《黄山学院学报》
2004年第6期6-8,共3页
Journal of Huangshan University
