共查询到20条相似文献,搜索用时 93 毫秒
1.
首先对空中加油问题进行了分析,提取了相关性质,在此基础上建立了问题的递推模型.根据该模型,提出了一种启发式搜索算法.该算法计算复杂度低,适用性好.对应于辅机是否可以多次起飞,该算法分为两子算法.对这两种不同情况下的具体问题,设计了相关的优化函数.所有算法都在计算机中运行,并得到了相应结果.值得指出的是,提出的启发式搜索算法十分高效.对于问题1和问题2,该算法所得解是约束条件下的最优调度策略.对于问题3,问题4,问题5,该算法所得解逼近最优调度策略. 相似文献
2.
基于遗传算法的大学课程表问题研究 总被引:3,自引:0,他引:3
课程表问题是时间表问题之一 ,也是 NP难问题 .根据大学授课形式的特点建立了大学课程表问题的数学模型 ,给出了求解该问题的遗传算法 .根据模型和大学课程表问题的特点设计了一种全新的编码 ,提出了一种新形式的交叉方式 .实验结果表明该方法是可行和有效的 . 相似文献
3.
讨论了一类具有超抛物型方程的反应扩散问题.首先,证明了比较定理.其次,构造了形式渐近解.然后,利用微分不等式方法,研究了问题解的存在、唯一性和渐近性态.最后得到了原问题解的渐近展开式. 相似文献
4.
5.
研究了一类变系数椭圆方程的柯西问题,这类问题出现在很多实际问题领域.由于问题的不适定性,不可能通过经典的数值方法来求解上述问题,必须引入正则化手段.采用了一种修正吉洪诺夫正则化方法来求解上述问题.在一种先验和一种后验参数选取准则下,分别获得了问题的误差估计.数值例子进一步显示方法是稳定有效的. 相似文献
6.
7.
8.
研究的是自主招生的面试安排问题.它与一个经典问题(Steiner System问题)有很紧密的联系.首先我们形式化地提出了这个问题,并针对问题提出了3种算法.值得一提的是,我们提出的同余构造算法在时间复杂度较低的情况下,具有很高的近似比(强于FPTAS).对于文理分科的情况,我们同样在形式化地提出问题之后,给出了相应的算法.我们编写程序实现了所述的算法. 相似文献
9.
文[6]中,F.Qi提出了一个未解决的不等式问题.本文给出了此问题的答案和进一步的拓广,同时也得到了该问题的反向不等式. 相似文献
10.
11.
本文研究求解非线性特征值问题的数值方法.基于矩阵值函数的二次近似,将非线性特征值问题转化为二次特征值问题,提出了求解非线性特征值问题的逐次二次近似方法,分析了该方法的收敛性.结合求解二次特征值问题的Arnoldi方法和Jacobi-Davidson方法,给出求解非线性特征值问题的一些二次近似方法.数值结果表明本文所给算法是有效的. 相似文献
12.
K. Malanowski 《Journal of Optimization Theory and Applications》1987,53(3):429-449
A family of optimal control problems for discrete systems that depend on a real parameter is considered. The problems are strongly convex and subject to state and control constraints. Some regularity conditions are imposed on the constraints.The control problems are reformulated as mathematical programming problems. It is shown that both the primal and dual optimal variables for these problems are right-differentiable functions of a parameter. The right-derivatives are characterized as solutions to auxiliary quadratic control problems. Conditions of continuous differentiability are discussed, and some estimates of the rate of convergence of the difference quotients to the respective derivatives are given. 相似文献
13.
Jerry Eriksson 《BIT Numerical Mathematics》1999,39(2):228-254
A new quasi-Newton method for nonlinear least squares problems is proposed. Two advantages of the method are accomplished by utilizing special geometrical properties in the problem class. First, fast convergence is established for well-conditioned problems by interpolating both the current and the previous step in each iteration. Second, high accuracy is achieved for certain difficult problems, such as ill-conditioned problems and problems with large curvatures in the tangent space. Numerical results for artificial problems and standard test problems are presented and discussed. 相似文献
14.
We propose general variational inclusion problems which are slightly different from corresponding problems considered in several recent papers in the literature and show that they are advantageous. Sufficient conditions for the solution existence are established. As applications we derive consequences for several special cases of variational inclusion problems, quasioptimization problems, equilibrium problems and implicit variational inequalities and show that they improve the results of some recent existing papers. 相似文献
15.
P. D. Frank M. J. Healy R. A. Mastro 《Journal of Optimization Theory and Applications》1991,69(1):109-127
Large and sparse convex quadratic programming problems are often generated in the course of solving large-scale optimization problems. An important class of these problems has the property that only a small number of constraints are at their bounds at a solution. We describe an implementation of a range-space method designed for efficient solution of these small-active-set problems. The implementation is oriented toward the application area of multidimensional data fitting subject to constraints. Test results are presented for several data-fitting problems.The authors are indebted to the referees for several valuable contributions 相似文献
16.
The global solution of bilevel dynamic optimization problems is discussed. An overview of a deterministic algorithm for bilevel
programs with nonconvex functions participating is given, followed by a summary of deterministic algorithms for the global
solution of optimization problems with nonlinear ordinary differential equations embedded. Improved formulations for scenario-integrated
optimization are proposed as bilevel dynamic optimization problems. Solution procedures for some of the problems are given,
while for others open challenges are discussed. Illustrative examples are given. 相似文献
17.
Necessary optimality conditions for Stackelberg problems 总被引:5,自引:0,他引:5
J. V. Outrata 《Journal of Optimization Theory and Applications》1993,76(2):305-320
First-order necessary optimality conditions are derived for a class of two-level Stackelberg problems in which the followers' lower-level problems are convex programs with unique solutions. To this purpose, generalized Jacobians of the marginal maps corresponding to followers' problems are estimated. As illustrative examples, two discretized optimum design problems with elliptic variational inequalities are investigated. The theoretical results may be used also for the numerical solution of the Stackelberg problems considered by nondifferentiable optimization methods.Communicated by M. Simaan 相似文献
18.
D. Bogusz 《Journal of Optimization Theory and Applications》2007,134(3):371-383
In this paper, a numerical method is presented to solve singularly-perturbed two-point boundary-value problems for second-order
ordinary differential equations with a discontinuous source term. First, an asymptotic expansion approximation of the solution
of the boundary-value problem is constructed using the basic ideas of the well-known WKB perturbation method. Then, some initial-value
problems and terminal-value problems are constructed such that their solutions are the terms of this asymptotic expansion.
These initial-value problems and terminal-value problems are singularly-perturbed problems and therefore fitted mesh method
(Shishkin mesh) are used to solve these problems. Necessary error estimates are derived and examples are provided to illustrate
the method. 相似文献
19.
半无限规划问题的一个有效解法 总被引:6,自引:0,他引:6
1.引言在计算机辅助设计和工程设计中,经常遇到下面的两类优化问题1,2].1.无约束半无限极大极小问题.其中外x)二——x。。Im。x。。。Yi夕(x;N)这里J二(】,2,·,}对任何7E八岁:R-xR”。+R是连续可微的函数,X是R”。中的一个紧子集,且VYj)一O,这里问h)表示X体积.2.约束半无限代化问题.其中I一(1,2,·.小记L二《0}UI对任何jCL冲’(x)一max。。。Yi夕(x,yi)·这里拉:PX*n+R是连续可微函数,X是”。中的一个紧子集,且NU)一0·注.设Y(Z,一二切EyW一叫卜4.今后对本文用到的紧子集地做… 相似文献
20.
凸二次规划问题逆问题的模型与解法 总被引:1,自引:0,他引:1
本文分别考虑带非负约束和不带大量负约束凸二次规划问题逆问题。首先得到各个逆问题的数学模型,然后对不同的模型给出不同的求解方法。 相似文献