共查询到20条相似文献,搜索用时 250 毫秒
1.
Summary The Bayesian estimation on lifetime data under fuzzy environments is proposed in this paper. In order to apply the Bayesian
approach, the fuzzy parameters are assumed as fuzzy random variables with fuzzy prior distributions. The (conventional) Bayesian
estimation method will be used to create the fuzzy Bayes point estimator by invoking the well-known theorem called “Resolution
Identity” in fuzzy set theory. On the other hand, we also provide computational procedures to evaluate the membership degree
of any given Bayes point estimate. In order to achieve this purpose, we transform the original problem into a nonlinear programming
problem. This nonlinear programming problem is then divided into four subproblems for the purpose of simplifying computation.
Finally, the subproblems can be solved by using any commercial optimizers, e.g., GAMS or LINDO. 相似文献
2.
In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints, we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem. 相似文献
3.
Since the observed values of security returns in real-world problems are sometimes imprecise or vague, an increasing effort in research is devoted to study the properties of risk measures in fuzzy portfolio optimization problems. In this paper, a new risk measure is suggested to gauge the risk resulted from fuzzy uncertainty. For this purpose, the absolute deviation and absolute semi-deviation are first defined for fuzzy variable by nonlinear fuzzy integrals. To compute effectively the absolute semi-deviations of single fuzzy variable as well as its functions, this paper discusses the methods of computing the absolute semi-deviation by classical Lebesgue–Stieltjes (L–S) integral. After that, several useful absolute deviation and absolute semi-deviation formulas are established for common triangular, trapezoidal and normal fuzzy variables. Applying the absolute semi-deviation as a new risk measure in portfolio optimization, three classes of fuzzy portfolio optimization models are developed by combining the absolute semi-deviation with expected value operator and credibility measure. Based on the analytical representation of absolute semi-deviations, the established fuzzy portfolio selection models can be turned into their equivalent piecewise linear or fractional programming problems. Since the absolute semi-deviation is a piecewise fractional function and pseudo-convex on the feasible subregions of deterministic programming models, we take advantage of the structural characteristics to design a domain decomposition method to separate a deterministic programming problem into three convex subproblems, which can be solved by conventional solution methods or general-purpose software. Finally, some numerical experiments are performed to demonstrate the new modeling idea and the effectiveness of the solution method. 相似文献
4.
The reliability-redundancy allocation problem is an optimization problem that achieves better system reliability by determining levels of component redundancies and reliabilities simultaneously. The problem is classified with the hardest problems in the reliability optimization field because the decision variables are mixed-integer and the system reliability function is nonlinear, non-separable, and non-convex. Thus, iterative heuristics are highly recommended for solving the problem due to their reasonable solution quality and relatively short computation time. At present, most iterative heuristics use sensitivity factors to select an appropriate variable which significantly improves the system reliability. The sensitivity factor represents the impact amount of each variable to the system reliability at a designated iteration. However, these heuristics are inefficient in terms of solution quality and computation time because the sensitivity factor calculations are performed only at integer variables. It results in degradation of the exploration and growth in the number of subsequent continuous nonlinear programming (NLP) subproblems. To overcome the drawbacks of existing iterative heuristics, we propose a new scaling method based on the multi-path iterative heuristics introduced by Ha (2004). The scaling method is able to compute sensitivity factors for all decision variables and results in a decreased number of NLP subproblems. In addition, the approximation heuristic for NLP subproblems helps to avoid redundant computation of NLP subproblems caused by outlined solution candidates. Numerical experimental results show that the proposed heuristic is superior to the best existing heuristic in terms of solution quality and computation time. 相似文献
5.
Steffen Rebennack Josef Kallrath Panos M. Pardalos 《Journal of Global Optimization》2009,43(2-3):277-297
We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are computed via subproblems. These problems can be linear, mixed integer linear, (non-)convex nonlinear, or mixed integer nonlinear. However, the important property of the subproblems is that we can compute their exact global optimum quickly. The proposed technique will be illustrated solving a cutting problem with optimum nonlinear programming subproblems. 相似文献
6.
Q. Ni 《计算数学(英文版)》1997,15(1):36-54
1.IntroductionInthispaperweconsiderthefollowingnonlinearprogrammingproblemminimizef(x)subjecttogj(x)2o,jEJ={1,...,m}.(1'1)Extensionstoproblemincludingalsoequalityconstraintswillbepossible.Thefunctionf:W-Rlandgj:Rn-R',jEJaretwicecontinuouslydifferentiable.Inpaxticular,weapplyQP-free(withoutquadraticprogrammingsubproblems),truncatedhybridmethodsforsolvingthelarge-scaJenonlinearprogrammingproblems,inwhichthenumberofvariablesandthenumberofconstraiotsin(1.1)aregreat.Wediscussthecase,wheresecon… 相似文献
7.
In this paper, we consider a nonlinear switched time-delayed (NSTD) system with an unknown time-varying function describing the batch culture. The output measurements are noisy. According to the actual fermentation process, this time-varying function appears in the form of a piecewise-linear function with unknown kinetic parameters and switching times. The quantitative definition of biological robustness is given to overcome the difficulty of accurately measuring intracellular material concentrations. Our main goal is to estimate these unknown quantities by using noisy output measurements and biological robustness. This estimation problem is formulated as a robust optimal control problem (ROCP) governed by the NSTD system subject to continuous state inequality constraints. The ROCP is approximated as a sequence of nonlinear programming subproblems by using some techniques. Due to the highly complex nature of these subproblems, we propose a hybrid parallel algorithm, based on Nelder–Mead method, simulated annealing and the gradients of the constraint functions, for solving these subproblems. The paper concludes with simulation results. 相似文献
8.
Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming 总被引:2,自引:0,他引:2
Li D. H. Yamashita N. Fukushima M. 《Journal of Optimization Theory and Applications》2001,109(1):123-167
In this paper, we present a BFGS method for solving a KKT system in mathematical programming, based on a nonsmooth equation reformulation of the KKT system. We split successively the nonsmooth equation into equivalent equations with a particular structure. Based on the splitting, we develop a BFGS method in which the subproblems are systems of linear equations with symmetric and positive-definite coefficient matrices. A suitable line search is introduced under which the generated iterates exhibit an approximate norm descent property. The method is well defined and, under suitable conditions, converges to a KKT point globally and superlinearly without any convexity assumption on the problem. 相似文献
9.
In this paper, we have discussed series system models with system reliability and cost. We have considered two types of the
model; the former focuses on a problem of optimal reliability for series system with cost constraint and the latter is a center
system cost model with reliability goal. It is necessary to improve the reliability of the system under limited available
cost of system and also to minimize the systems cost subject to target goal of the reliability. Practically, cost of components
has always been imprecise with vague in nature. So they are taken as fuzzy in nature and the reliability models are formulated
as a fuzzy parametric geometric programming problem. Numerical examples are given to illustrate the model through fuzzy parametric
geometric programming technique. 相似文献
10.
11.
In this paper,a new globally convergent algorithm for nonlinear optimization prablems with equality and inequality constraints is presented. The new algorithm is of SQP type which determines a search direction by solving a quadratic programming subproblem per itera-tion. Some revisions on the quadratic programming subproblem have been made in such a way that the associated constraint region is nonempty for each point x generated by the algorithm, i. e. , the subproblems always have optimal solutions. The new algorithm has two important properties. The computation of revision parameter for guaranteeing the consistency of quadratic sub-problem and the computation of the second order correction step for superlinear convergence use the same inverse of a matrix per iteration, so the computation amount of the new algorithm will not be increased much more than other SQP type algorithms; Another is that the new algorithm can give automatically a feasible point as a starting point for the quadratic subproblems pe 相似文献
12.
We propose a novel solution approach for the class of two-stage nonlinear integer stochastic programming models. These problems
are characterized by large scale dimensions, as the number of constraints and variables depend on the number of realizations
(scenarios) used to capture the underlying distributions of the random data. In addition, the integrality constraints on the decision
variables make the solution process even much more difficult preventing the application of general purpose solvers. The proposed
solution approach integrates the branch-and-bound framework with the interior point method. The main advantage of this choice
is the effective exploitation of the specific structure exhibited by the different subproblems at each node of the search
tree. A specifically designed warm start procedure and an early branching technique improve the overall efficiency. Our contribution
is well founded from a theoretical point of view and is characterized by good computational efficiency, without any loss in
terms of effectiveness. Some preliminary numerical results, obtained by solving a challenging real-life problem, prove the
robustness and the efficiency of the proposed approach. 相似文献
13.
《Applied Mathematical Modelling》2014,38(15-16):3987-4005
In this study, we reduce the uncertainty embedded in secondary possibility distribution of a type-2 fuzzy variable by fuzzy integral, and apply the proposed reduction method to p-hub center problem, which is a nonlinear optimization problem due to the existence of integer decision variables. In order to optimize p-hub center problem, this paper develops a robust optimization method to describe travel times by employing parametric possibility distributions. We first derive the parametric possibility distributions of reduced fuzzy variables. After that, we apply the reduction methods to p-hub center problem and develop a new generalized value-at-risk (VaR) p-hub center problem, in which the travel times are characterized by parametric possibility distributions. Under mild assumptions, we turn the original fuzzy p-hub center problem into its equivalent parametric mixed-integer programming problems. So, we can solve the equivalent parametric mixed-integer programming problems by general-purpose optimization software. Finally, some numerical experiments are performed to demonstrate the new modeling idea and the efficiency of the proposed solution methods. 相似文献
14.
《European Journal of Operational Research》2002,143(2):452-461
We propose a new method for certain multistage stochastic programs with linear or nonlinear objective function, combining a primal interior point approach with a linear-quadratic control problem over the scenario tree. The latter problem, which is the direction finding problem for the barrier subproblem is solved through dynamic programming using Riccati equations. In this way we combine the low iteration count of interior point methods with an efficient solver for the subproblems. The computational results are promising. We have solved a financial problem with 1,000,000 scenarios, 15,777,740 variables and 16,888,850 constraints in 20 hours on a moderate computer. 相似文献
15.
Shanshan Wang Luming Zhang 《Applied mathematics and computation》2011,218(5):1903-1916
Split-step orthogonal spline collocation (OSC) methods are proposed for one-, two-, and three-dimensional nonlinear Schrödinger (NLS) equations with time-dependent potentials. Firstly, the NLS equation is split into two nonlinear equations, and one or more one-dimensional linear equations. Commonly, the nonlinear subproblems could be integrated directly and accurately, but it fails when the time-dependent potential cannot be integrated exactly. In this case, we propose three approximations by using quadrature formulae, but the split order is not reduced. Discrete-time OSC schemes are applied for the linear subproblems. In numerical experiments, many tests are carried out to prove the reliability and efficiency of the split-step OSC (SSOSC) methods. Solitons in one, two, and three dimensions are well simulated, and conservative properties and convergence rates are demonstrated. We also apply the ways of solving the nonlinear subproblems to the split-step finite difference (SSFD) methods and the time-splitting spectral (TSSP) methods, and the approximate ways still work well. Finally, we apply the SSOSC methods to solve some problems of Bose-Einstein condensates. 相似文献
16.
带组约束可靠性网络最优化问题的精确算法 总被引:1,自引:0,他引:1
本文提出了一种求解带组约束串-并网络系统最优冗余问题的精确算法.该算法利用拉格朗日松驰和Dantzig-Wolfe分解法得到问题的上界,并结合动态规划求解子问题.算法采用一种有效的切割和剖分方法,以逐步缩小对偶间隙和保证收敛性.数值结果表明该算法对于求解带组约束可靠性最优化问题是很有效的. 相似文献
17.
The optimization problem in this paper is targeted at large-scale hydrothermal power systems. The thermal part of the system is a multi-area power pool with tie-line constraints, and the hydro part is a set of cascaded hydrostations. The objective is to minimize the operation cost of the thermal subsystem. This is an integer nonlinear optimization process with a large number of variables and constraints. In order to obtain the optimal solution in a reasonable time, we decompose the problem into thermal and hydro subproblems. The coordinator between these subproblems is the system Lagrange multiplier. For the thermal subproblem, in a multi-area power pool, it is necessary to coordinate the area generations for reducing the operation cost without violating tie limits. For the hydro subsystem, network flow concepts are adopted to coordinate water usage over the entire study time span, and the reduced gradient method is used to overcome the linear characteristic of the network flow method in order to obtain the optimal solution. In this study, load forecasting errors and forced outages of generating units are incorporated in system reliability requirements. Three case studies for the proposed method are presented. 相似文献
18.
解带有二次约束二次规划的一个整体优化方法 总被引:1,自引:0,他引:1
在本文中,我们提出了一种解带有二次约束二次规划问题(QP)的新算法,这种方法是基于单纯形分枝定界技术,其中包括极小极大问题和线性规划问题作为子问题,利用拉格朗日松弛和投影次梯度方法来确定问题(QP)最优值的下界,在问题(QP)的可行域是n维的条件下,如果这个算法有限步后终止,得到的点必是问题(QP)的整体最优解;否则,该算法产生的点的序列{v^k}的每一个聚点也必是问题(QP)的整体最优解。 相似文献
19.
In this paper, we propose a robust sequential quadratic programming (SQP) method for nonlinear programming without using any explicit penalty function and filter. The method embeds the modified QP subproblem proposed by Burke and Han (Math Program 43:277–303, 1989) for the search direction, which overcomes the common difficulty in the traditional SQP methods, namely the inconsistency of the quadratic programming subproblems. A non-monotonic technique is employed further in a framework in which the trial point is accepted whenever there is a sufficient relaxed reduction of the objective function or the constraint violation function. A forcing sequence possibly tending to zero is introduced to control the constraint violation dynamically, which is able to prevent the constraint violation from over-relaxing and plays a crucial role in global convergence and the local fast convergence as well. We prove that the method converges globally without the Mangasarian–Fromovitz constraint qualification (MFCQ). In particular, we show that any feasible limit point that satisfies the relaxed constant positive linear dependence constraint qualification is also a Karush–Kuhn–Tucker point. Under the strict MFCQ and the second order sufficient condition, furthermore, we establish the superlinear convergence. Preliminary numerical results show the efficiency of our method. 相似文献
20.
定数截尾两参数指数——威布尔分布形状参数的Bayes估计 总被引:2,自引:0,他引:2
在不同的损失函数下,本文研究了两参数指数—威布尔分布(EWD)形状参数的Bayes估计问题.基于定数截尾试验,当其中一个形状参数α已知时,给出了另一个形状参数θ在三种不同损失函数下的Bayes估计表达式,并求得了可靠度函数的Bayes点估计.最后运用随机模拟方法,将Bayes估计和极大似然估计进行了比较.结果表明,LINEX损失下Bayes估计的精度比极大似然估计高. 相似文献