首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
文献[1]讨论了有无穷多最优解的线性规划问题,并利用最优单纯形表格的检验数给出线性规划有无穷多最优解的判别法,本文利用最优基可行解的凸组合及最优极向的非负线性组合给出线性规划最优解集的表现,从而把线性规划最优解集的几何特征阐释清楚.  相似文献   

2.
在某些情况下,经典指派问题的最优解不唯一.不同的最优解对参与人的影响不同,导致每个参与人会争取最有利于自身的最优解.为解决这个问题,通过研究允许合作指派问题的合作对策解的形成,提出允许合作指派问题的讨价还价模型和个体理性激励函数.在此基础上,提出了一个考虑个体理性的指派问题多重最优解的择优方法,从而保证了指派问题最优解的唯一性.  相似文献   

3.
单机排序问题最优解的结构及其求法   总被引:2,自引:0,他引:2  
本文研究了单机排序问题|r_i=0|∑|c_i-d_i|最优解的结构.提出了最优解的紧密规则,以及最优解的近似求法.  相似文献   

4.
首先给出了运输问题最优解的相关概念,将最优解扩展到广义范畴,提出狭义多重最优解和广义多重最优解的概念及其区别.然后给出了惟一最优解、多重最优解、广义有限多重最优解、广义无限多重最优解的判定定理及其证明过程.最后推导出了狭义有限多重最优解个数下限和广义有限多重最优解个数上限的计算公式,并举例验证了结论的正确性.  相似文献   

5.
线性规划多重最优解判别准则刍议   总被引:1,自引:0,他引:1  
本构造了一些线性规划问题来探讨多重最优解的判别准则,补充了现行献中关于多重最优解判别准则描述的不足,并指出多重最优解判别准则在出现退化解时可能失效的例外情况。  相似文献   

6.
本文讨论了线性分式规划问题min以及它的最优性条件.证明了它的局布最优解一定是整体最优解,并且局布最优解正定在约束条件的基本可行解处达到.  相似文献   

7.
本通过分析两用阶段法求解线性规划初始可行解的一个例子,归纳了线性规划问题退化的最优基可行解的性质,包括同一退化最优基可行解不同表示,有无穷多最优解的表示。  相似文献   

8.
带随机过程的随机规划问题最优解集的过程特性与稳定性   总被引:1,自引:0,他引:1  
本文证明了带随机过程的随机规划问题最优解集做为集值随机过程的可测性、可测最优解选择过程的存在性。研究了最优解集过程的平稳性、马氏性以及最优值过程的鞅性和最优解集过程的集值鞅性。最后,讨论了在有限维分布意义下最优解集过程对所含随机过程参数的连续性以及最优值过程的稳定性。  相似文献   

9.
本文讨论了无界域上凹二次规划有最优解的充要条件,通过解若干个线性规划,可以判别出无界域上四二次规划是否有最优解。  相似文献   

10.
基于GA的一类Fuzzy资源非线性规划问题的模型   总被引:5,自引:0,他引:5  
本文建立了一类连续型Fuzzy资源约束非线性规划问题的模型FRNLP。基于fuzzy最优解集和最优决策集,提出了求解FRNLP模型的精确最优解和满意解的方法,最后研究并讨论了具有惩罚因子的fuzzy资源约束非线性规划问题,并针对一个实例进行了分析。  相似文献   

11.
介绍了模糊数学和整数规划的背景、现状、以及发展趋势,并以模糊结构元理论定义了梯形模糊加权序,进一步证明了模糊整数规划模型的最优解等价于整数规划模型的最优解,再利用整数规划模型的最优解的求解方法求解模糊整数规划模型的最优解,最后,通过算例验证方法的可行性.  相似文献   

12.
In this paper, we focus on a treatment of a linear programming problem with an interval objective function. From the viewpoint of the achievement rate, a new solution concept, the maximin achievement rate solution, is proposed. Nice properties of this solution are shown: a maximin achievement rate solution is necessarily optimal when a necessarily optimal solution exists, and if not, then it is still a possibly optimal solution. An algorithm for a maximin achievement rate solution is proposed based on a relaxation procedure together with a simplex method. A numerical example is given to demonstrate the proposed solution algorithm.  相似文献   

13.
In the paper, a two-grid finite element scheme is discussed for distributed optimal control governed by elliptic equations. With this new scheme, the solution of the elliptic optimal control problem on a fine grid is reduced to the solution of the elliptic optimal control problem on a much coarser grid and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy. Finally, numerical experiments are carried out to confirm the considered theory.  相似文献   

14.
Most existing methods of global optimization for generalized geometric programming (GGP) actually compute an approximate optimal solution of a linear or convex relaxation of the original problem. However, these approaches may sometimes provide an infeasible solution, or far from the true optimum. To overcome these limitations, a robust solution algorithm is proposed for global optimization of (GGP) problem. This algorithm guarantees adequately to obtain a robust optimal solution, which is feasible and close to the actual optimal solution, and is also stable under small perturbations of the constraints.  相似文献   

15.
Active constraint set invariancy sensitivity analysis is concerned with finding the range of parameter variation so that the perturbed problem has still an optimal solution with the same support set that the given optimal solution of the unperturbed problem has. However, in an optimization problem with inequality constraints, active constraint set invariancy sensitivity analysis aims to find the range of parameter variation, where the active constraints in a given optimal solution remains invariant.For the sake of simplicity, we consider the primal problem in standard form and consequently its dual may have an optimal solution with some active constraints. In this paper, the following question is answered: “what is the range of the parameter, where for each parameter value in this range, a dual optimal solution exists with exactly the same set of positive slack variables as for the current dual optimal solution?”. The differences of the results between the linear and convex quadratic optimization problems are highlighted too.  相似文献   

16.
In this paper, least-squaxes mirrorsymmetric solution for matrix equations (AX = B, XC = D) and its optimal approximation is considered. With special expression of mirrorsymmetric matrices, a general representation of solution for the least-squares problem is obtained. In addition, the optimal approximate solution and some algorithms to obtain the optimal approximation are provided.  相似文献   

17.
赵茂先  高自友 《应用数学》2006,19(3):642-647
通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.  相似文献   

18.
实践表明 ,对状态变量的递增量较大的报童问题 ,应用传统的离散型报童模型所确定的最优决策量与实际最优方案之间可能存在较大偏差 .分析了这一偏差出现的原因 ,提出了状态变量递增量较大的情况下的离散变量报童模型和求解方法 ,并证明这一模型比原模型得出的求解结果更为精确 .最后 ,通过算例验证了新模型对原模型的改进 .  相似文献   

19.
研究了一类线性椭圆型分布参数最优控制问题的数值解算法.得到最优控制对应的最优性方程组,在凸性条件下,证明了最优控制的唯一存在性问题.将最优控制问题化为以控制函数和状态函数为局中人的递阶式(Stackelberg)非合作对策问题,其平衡点是最优控制的解.进一步得到求平衡点的边界元共轭梯度算法.最后,研究算法中边界元离散的误差估计,以算例验证该算法.  相似文献   

20.
This paper investigates the problem of jointly determining the order size and optimal prices for a perishable inventory system under the condition that demand is time and price dependent. It is assumed that a decision-maker has the opportunity to adjust prices before the end of the sales season to influence demand and to improve revenues. A mathematical model is developed to find the optimal number of prices, the optimal prices and the order quantity. Analytical results show that a stationary solution to the Kuhn–Tucker necessary conditions can be found and it is shown to be the optimal solution. The analytical results lead us to derive a solution procedure for determining the optimal order size and prices.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号