下层多人且独立的两层多目标决策问题的方向搜索算法

建立了下层多人且独立的两层多目标决策问题的数学模型和决策机制,在证明了若干定理的基础上,提出一种方向搜索算法,该方法与实际的决策过程较接近,人-机交互过程简单。     

双层多目标线性规划问题的一个算法

现有方法常常将双层多目标线性规则问题(下层决策者无关联)的下层问题的最优性条件转换为上层问题的严格约束,这样缩小了上层决策问题解的搜索范围,与实际中的决策过程相违背。因此,基于隶属函数以及模糊数等有关性质,提出了一种模糊决策方法;同时,在上下层问题独立求解时,引入了一种多项式的时间算法,为两层以及多层决策问题提供了新的求解途径。     

下层分组的两层决策方法

下层分组的两层决策方法夏洪胜（系统科学系）本文的研究是针对如下特点的两层决策问题：ｉ）上层有多个决策要作出，每个决策影响下层某些部门，上、下层决策人各自控制自身的决策变量；ｉｉ）上层决策人较下层决策人有更大的权力和利益，下层决策人在满足自身基本需求的...     

具有层次结构的多人多目标决策方法

针对上层多目标、下层多人有关联多目标的两层决策问题，建立了其数学模型，利用辅助模型将各层上的多目标转化为单目标，然后采用外部逼近法求解以获得两层多目标决策问题的满意解．     

Bilevel programming model and solution method for mixed transportation network design problem

By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm. This research is supported by the National Basic Research Program of China under Grant No. 2006CB705500, the National Natural Science Foundation of China under Grant No. 0631001, the Program for Changjiang Scholars and Innovative Research Team in University, and Volvo Research and Educational Foundations.     

BILEVEL PROGRAMS WITH MULTIPLE FOLLOWERS

1.IntroductionMultilevelprogramming,anestedoptimizationproblem,emergedasanappropriatemodeltosolvetheproblemofc00rdinatingthedecisi0nmakingprocessinadecentralizedsystembyimprovingthe0bjectiveofthehighestlevelofahierarchica.lorganizati0n,whiledealingwiththetendency0fthelowerlevelsofthehierarchytoimprovetheirownobjectives.Thedecisionsofthelowerlevelsarenotdictatedbytheirsuperiors,however,theirreactionstotheupperlevels'actionsareperfectlyknown.Thehierarchicalnatureoftheproblemisreflectedbytheorder…     

A Note on Relations between Linear Bilevel Programming and Linear Bicriteria Programming

ＡＮｏｔｅｏｎＲｅｌａｔｉｏｎｓｂｅｔｗｅｅｎＬｉｎｅａｒＢｉｌｅｖｅｌＰｒｏｇｒａｍｍｉｎｇａｎｄ　ＬｉｎｅａｒＢｉｃｒｉｔｅｒｉａＰｒｏｇｒａｍｍｉｎｇＡＮｏｔｅｏｎＲｅｌａｔｉｏｎｓｂｅｔｗｅｅｎＬｉｎｅａｒＢｉｌｅｖｅｌＰｒｏｇｒａｍｍｉｎｇ...     

技术联盟投资决策的模拟植物生长优化分析

在协作双方对等投资的条件下,通过构建技术联盟投资决策模拟植物生长的二层规划模型,分析企业参加技术联盟研发收益最大化和自主核心研发能力最优化的组合目标问题,得出协作研发和自主研发的最优投资组合。研究结果显示企业参与技术联盟的研发收益最大化和自主核心研发能力最优化的投资决策目标可以兼顾。依据全局最优解和局部最优解的组合比较,企业可以根据实际决策需要进行投资方案的调整,以增加投资和谈判的灵活性。