共查询到20条相似文献,搜索用时 78 毫秒
1.
下层随机规划以上层决策变量作为参数,而上层随机规划是以下层随机规划的唯一最优解作为响应的一类二层随机规划问题,首先在下层随机规划的原问题有唯一最优解的假设下,讨论了下层随机规划的任意一个逼近最优解序列都收敛于原问题的唯一最优解,然后将下层随机规划的唯一最优解反馈到上层,得到了上层随机规划逼近最优解集序列的上半收敛性. 相似文献
2.
3.
文章针对下层随机规划反馈的最优解不唯一,上层为单目标约束随机规划的一类乐观型二层随机规划逼近问题,构建了求解乐观型二层随机规划逼近最优解集上半收敛的理论框架.首先将乐观型二层随机规划等价转化为单层随机规划问题,通过逼近方法建立了无界可积函数在有限区域上以及全空间上的一致逼近定理,应用此结果给出了目标函数的连续收敛性和约束集的K-收敛性.其次利用上图收敛理论,得到了乐观型二层随机规划逼近最优解集的上半收敛性.该结论提供了乐观型二层随机规划逼近最优解集可以近似替代精确的最优解集的理论依据,结果表明离散化逼近方法是可行的、有效的、合理的. 相似文献
4.
本文提出强上图收敛的概念,讨论了逼近随机规划的目标函数序列的强上图收敛性,研究了逼近随机规划最优值和最优解集的收敛性条件,得到了一类随机规划逼近最优值和最优解集的收敛性. 相似文献
5.
以下层规划的最优值作为响应反馈到上层的一类二层规划问题,可以放宽要求下层规划具有唯一解的限制.本文旨在讨论这类二层规划序列的上图收敛性,从而对近似求解这类问题提供了一定的理论依据. 相似文献
6.
下层问题以上层决策变量作为参数,而上层是以下层问题的最优值作为响应
的一类最优化问题——二层规划问题。我们给出了由一系列此类二层规划去逼近原二层规划的逼近法,得到了这种逼近的一些有趣的结果. 相似文献
7.
本提出了二层随机规划模型,给出了求解二层随机规划问题的基于随机模拟的遗传算法。实际算例表明算法是可行的、有效的。 相似文献
8.
本文给出了随机规划经验逼近最优解集几乎处处下半收敛的一个充分条件,并由此得到随机规划经验逼近最优解集几乎处处Hausdorff收敛的一个充分条件. 相似文献
9.
本文讨论取位于Banach空间的对称、独立和可控的随机测度的收敛性,Vitali-HahnSake定理,Skorokhod定理以及由Hoffman-Jorgensen-Pisier提出的关于这种测度的中心极限定理. 相似文献
10.
随机规划中的一些逼近结果 总被引:1,自引:0,他引:1
主要讨论了一类随机规划的目标函数分别在概率测度序列分布收敛、函数序列上图收敛以及随机变量序列均方可积收敛等收敛意义下目标函数序列的收敛情况。基于上述收敛情况给出了一些逼近思想,这些思想可应用于求解这类随机规划问题。 相似文献
11.
Interactive fuzzy programming approach to Bi-level quadratic fractional programming problems 总被引:1,自引:0,他引:1
In this paper we propose an interactive fuzzy programming method for obtaining a satisfactory solution to a “bi-level quadratic
fractional programming problem” with two decision makers (DMs) interacting with their optimal solutions. After determining
the fuzzy goals of the DMs at both levels, a satisfactory solution is efficiently derived by updating the satisfactory level
of the DM at the upper level with consideration of overall satisfactory balance between both levels. Optimal solutions to
the formulated programming problems are obtained by combined use of some of the proper methods. Theoretical results are illustrated
with the help of a numerical example. 相似文献
12.
B. Bereanu 《Journal of Optimization Theory and Applications》1976,18(3):319-333
It is proved a sufficient condition that the optimal value of a linear program be a continuous function of the coefficients. The condition isessential, in the sense that, if it is not imposed, then examples with discontinuous optimal-value function may be found. It is shown that certain classes of linear programs important in applications satisfy this condition. Using the relation between parametric linear programming and the distribution problem in stochastic programming, a necessary and sufficient condition is given that such a program has optimal value. Stable stochastic linear programs are introduced, and a sufficient condition of such stability, important in computation problems, is established.This note is a slightly modified version of a paper presented at the Institute of Econometrics and Operations Research of the University of Bonn, Bonn, Germany, 1972.The author is grateful to G. B. Dantzig and S. Karamardian for useful comments on an earlier draft of this paper. In particular, S. Karamardian proposed modifications which made clearer the proof of Lemma 2.1. 相似文献
13.
非线性整数规划的一个近似算法 总被引:13,自引:1,他引:13
利用连续总体优化填充函数法的思想,本文设计了非线性整数规划的一个近似算法.首先,给出了非线性整数规划问题离散局部极小解的定义,设计了找离散局部极小解的局部搜索算法;其次,用所设计的局部搜索算法极小化填充函数来找比当前离散局部极小解好的解.本文的近似算法是直接法,且与连续总体优化的填充函数法相比,本文填充函数中的参数易于选取.数值试验表明,本文的近似算法是有效的. 相似文献
14.
The treasurer of a bank is responsible for the cash management of several banking activities. In this work, we focus on two of them: cash management in automatic teller machines (ATMs), and in the compensation of credit card transactions. In both cases a decision must be taken according to a future customers demand, which is uncertain. From historical data we can obtain a discrete probability distribution of this demand, which allows the application of stochastic programming techniques. We present stochastic programming models for each problem. Two short-term and one mid-term models are presented for ATMs. The short-term model with fixed costs results in an integer problem which is solved by a fast (i.e. linear running time) algorithm. The short-term model with fixed and staircase costs is solved through its MILP equivalent deterministic formulation. The mid-term model with fixed and staircase costs gives rise to a multi-stage stochastic problem, which is also solved by its MILP deterministic equivalent. The model for compensation of credit card transactions results in a closed form solution. The optimal solutions of those models are the best decisions to be taken by the bank, and provide the basis for a decision support system. 相似文献
15.
《Optimization》2012,61(6):821-832
In this article, various types of approximate solutions for vector quasi-variational problems in Banach spaces are introduced. Motivated by [M.B. Lignola, J. Morgan, On convergence results for weak efficiency in vector optimization problems with equilibrium constraints, J. Optim. Theor. Appl. 133 (2007), pp. 117–121] and in line with the results obtained in optimization, game theory and scalar variational inequalities, our aim is to investigate lower convergence properties (in the sense of Painlevé–Kuratowski) for such approximate solution sets in the presence of perturbations on the data. Sufficient conditions are obtained for the lower convergence of ‘strict approximate’ solution sets but counterexamples show that, in general, the other types of solutions do not lower converge. Moreover, we prove that any exact solution to the limit problem can be obtained as the limit of a sequence of approximate solutions to the perturbed problems. 相似文献
16.
S. D. Flåm 《Journal of Optimization Theory and Applications》1985,46(1):23-30
The paper gives strong duality results in multistage stochastic programming without assuming compactness and without applying induction arguments. 相似文献
17.
The convergence of a Dinkelbach-type algorithm in generalized fractional programming is obtained by considering the sensitivity of a parametrized problem. We show that the rate of convergence is at least equal to (1+5)/2 when regularity conditions hold in a neighbourhood of the optimal solution. We give also a necessary and sufficient condition for the convergence to be quadratic (which will be verified in particular in the linear case) and an idea of its implementation in the convex case.
Zusammenfassung Die Konvergenz eines Verfahrens i. S. von Dinkelbach zur Lösung verallgemeinerter Quotientenprogramme wird durch Untersuchung der Sensitivität eines parametrisierten Problems abgeleitet. Es wird gezeigt, daß die Konvergenzrate durch (1+5)/2 nach unten beschränkt ist, falls gewisse Regularitätsbedingungen in einer Umgebung der Optimallösung erfüllt sind. Ferner wird eine notwendige und hinreichende Bedingung zur quadratischen Konvergenz hergeleitet. Es wird gezeigt, wie diese im Falle konvexer Probleme implementiert werden kann.相似文献
18.
Several exponential bounds are derived by means of the theory of large deviations for the convergence of approximate solutions of stochastic optimization problems. The basic results show that the solutions obtained by replacing the original distribution by an empirical distribution provides an effective tool for solving stochastic programming problems.Supported in part by a grant from the US-Israel Science Foundation. 相似文献
19.
The purpose of this paper is to analyze the convergence of interval-type algorithms for solving the generalized fractional program. They are characterized by an interval [LB
k
, UB
k
] including*, and the length of the interval is reduced at each iteration. A closer analysis of the bounds LB
k
and UB
k
allows to modify slightly the best known interval-type algorithm NEWMODM accordingly to prove its convergence and derive convergence rates similar to those for a Dinkelbach-type algorithm MAXMODM under the same conditions. Numerical results in the linear case indicate that the modifications to get convergence results are not obtained at the expense of the numerical efficiency since the modified version BFII is as efficient as NEWMODM and more efficient than MAXMODM.This research was supported by NSERC (Grant A8312) and FCAR (Grant 0899). 相似文献
20.
Silvia Vogel 《Mathematical Programming》1992,56(1-3):91-119
In this paper we assume that a deterministic multiobjective programming problem is approximated by surrogate problems based on estimations for the objective functions and the constraints. Making use of a large deviations approach, we investigate the behaviour of the constraint sets, the sets of efficient points and the solution sets if the size of the underlying sample tends to infinity. The results are illustrated by applying them to stochastic programming with chance constraints, where (i) the distribution function of the random variable is estimated by the empirical distribution function, (ii) certain parameters have to be estimated. 相似文献