共查询到20条相似文献,搜索用时 111 毫秒
1.
概率约束随机规划的一种近似方法及其它的有效解模式 总被引:2,自引:0,他引:2
根据最小风险的投资最优问题,我们给出了一个统一的概率约束随机规划模型。随后我们提出了求解这类概率约束随机规划的一种近似算法,并在一定的条件下证明了算法的收敛性。此外,提出了这种具有概率约束多目标随机规划问题的一种有效解模型。 相似文献
2.
3.
本文研究基于随机基准的最优投资组合选择问题. 假设投资者可以投资于一种无风险资产和一种风险股票,并且选择某一基准作为目标. 基准是随机的, 并且与风险股票相关.
投资者选择最优的投资组合策略使得终端期望绝对财富和基于基准的相对财富效用最大.
首先, 利用动态规划原理建立相应的HJB方程, 并在幂效用函数下,得到最优投资组合策略和值函数的显示表达式. 然后,分析相对业绩对投资者最优投资组合策略和值函数的影响. 最后, 通过数值计算给出了最优投资组合策略和效用损益与模型主要参数之间的关系. 相似文献
4.
带交易费用的证券组合投资选择的优化模型 总被引:1,自引:0,他引:1
本文利用在约束条件中加入证券多样化选择约束的办法来抵减非系统风险 ,就证券组合投资的选择问题 ,建立了带交易费用的综合考虑收益和风险的多目标规划模型 ,然后通过变换将不可微的多目标规划问题转化为一个多目标线性规划问题 ,最后给出了问题的一个算法和算例 相似文献
5.
6.
7.
8.
目标规划法在证券组合投资中的应用 总被引:2,自引:0,他引:2
证券投资是目前我国经济中的一大热点。本以Markowitz证券组合投资理论为基础,运用目标规划的方法建立一种新的证券组合投资决策模型。在本模型中综合考虑了证券组合的收益,风险,交易费用等因素,对投资选择有效证券组合有一定的实用价值。 相似文献
9.
基于供应链风险和供应链绩效的模糊性和供应商选择问题的动态性,本文考虑供应链风险和供应链绩效作为模糊变量,讨论如何给生产商一个满意的动态多目标供应商选择方案,确定供应链风险和总成本最小,以及供应链绩效最大。然后对该问题提出了一个动态多目标多产品供应商选择模型,该模型是首次同时考虑供应商选择,订单分配,供应链风险和供应链绩效的一个模糊动态非线性多目标规划模型。为了去模糊化和求解该模型,给出了一个风险和绩效的模糊评估法。最后给出一个数值算例验证了该模型的可行性,为决策者选择供应商提供了理论依据。 相似文献
10.
随机多目标规划区间交互过程及其应用 总被引:1,自引:0,他引:1
针对随机多目标规划问题中目标函数含有连续型随机变量的情形,设计一种基于概率有效性意义下的区间交互过程,将概率有效性与多目标问题理想点进行有机结合,有效辅助决策者寻求愿意承受的风险水平,并进行决策,简化了随机多目标优化问题。最后通过实例说明该交互过程的作用。 相似文献
11.
本文基于模糊结构元方法建立并讨论了一类含有直觉模糊弹性约束的广义模糊变量线性 规划问题。首先,简单介绍了结构元方法并对结构元加权排序中权函数表征决策者风险态度进行了深入分析。然后,通过选取风险中立型决策态度来定义序关系并拓展Verdegay模糊线性规划方法,将新型模糊变量线性规划问题转化为两个含一般模糊弹性约束的模糊变量线性规划模型,给出了此类规划最优直觉模糊解的求法。最后,通过数值算例进一步说明该方法的有效性。 相似文献
12.
Zhiqing Meng Chuangyin Dang Rui Shen Ming Jiang 《Journal of Optimization Theory and Applications》2012,153(2):377-387
Penalty methods are very efficient in finding an optimal solution to constrained optimization problems. In this paper, we
present an objective penalty function with two penalty parameters for inequality constrained bilevel programming under the
convexity assumption to the lower level problem. Under some conditions, an optimal solution to a bilevel programming defined
by the objective penalty function is proved to be an optimal solution to the original bilevel programming. Moreover, based
on the objective penalty function, an algorithm is developed to obtain an optimal solution to the original bilevel programming,
with its convergence proved under some conditions. 相似文献
13.
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models
- studied in mathematical finance for several decades - have attracted attention in stochastic programming. We consider Conditional
Value-at-Risk as risk measure in the framework of two-stage stochastic integer programming. The paper addresses structure,
stability, and algorithms for this class of models. In particular, we study continuity properties of the objective function,
both with respect to the first-stage decisions and the integrating probability measure. Further, we present an explicit mixed-integer
linear programming formulation of the problem when the probability distribution is discrete and finite. Finally, a solution
algorithm based on Lagrangean relaxation of nonanticipativity is proposed.
Received: April, 2004 相似文献
14.
This paper first applies the fuzzy set theory to multi-objective semi-definite program-ming (MSDP), and proposes the fuzzy multi-objective semi-definite programming (FMSDP) model whose optimal efficient solution is defined for the first time, too. By constructing a membership function, the FMSDP is translated to the MSDP. Then we prove that the optimal efficient solution of FMSDP is consistent with the efficient solution of MSDP and present the optimality condition about these programming. At last, we give an algorithm for FMSDP by introducing a new membership function and a series of transformation. 相似文献
15.
16.
The penalty function method, presented many years ago, is an important numerical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty function approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach. 相似文献
17.
18.
The fuzzy relation programming problem is a minimization problem with a linear objective function subject to fuzzy relation equations using certain algebraic compositions. Previously, Guu and Wu considered a fuzzy relation programming problem with max-product composition and provided a necessary condition for an optimal solution in terms of the maximum solution derived from the fuzzy relation equations. To be more precise, for an optimal solution, each of its components is either 0 or the corresponding component's value of the maximum solution. In this paper, we extend this useful property for fuzzy relation programming problem with max-strict-t-norm composition and present it as a supplemental note of our previous work. 相似文献
19.
20.
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method 总被引:3,自引:0,他引:3
In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes
of nonlinear integer programming problems: separable nonlinear integer programming and polynomial zero-one programming. The
method exposes an optimal solution to the convex hull of a revised perturbation function by successively reshaping or re-confining
the perturbation function. The objective level cut is used to eliminate the duality gap and thus to guarantee the convergence
of the Lagrangian method on a revised domain. Computational results are reported for a variety of nonlinear integer programming
problems and demonstrate that the proposed method is promising in solving medium-size nonlinear integer programming problems. 相似文献