共查询到19条相似文献，搜索用时 203 毫秒
1.
Multi-dimensional nonlinear knapsack problems are often encountered in resource allocation, industrial planning and computer networks. In this paper, a surrogate dual method was proposed for solving this class of problems. Multiply constrained problem was relaxed to a singly constrained problem by using the surrogate technique. To compute tighter bounds of the primal problem, the cutting plane method was used to solve the surrogate dual problem, where the surrogate relaxation problem was solved by the 0-1 linearization method. The domain cut technique was employed to eliminate the duality gap and thus to guarantee the convergence of tile algorithm. Numerical results were reported for large-scale multi-dimensional nonlinear knapsack problems. 相似文献
2.
In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding another at each cycle. The auxiliary function can ensure that a point, except a prescribed point, is not its integer stationary point if the value of objective function at the point is greater than the scalar which is chosen properly. This property leads to a better minimizer of f found more easily by some classical local search methods. The computational results show that this algorithm is quite efficient and reliable for solving nonlinear integer programming problems. 相似文献
3.
This paper dealt with composite scheduling problems which combine manufacturing scheduling problems and/or transportation routing problems.Two scheduling models were formulated as the elements of the composite scheduling model,and the composite model was formulated composing these models with indispensable additional constraints.A hybrid genetic algorithm was developed to solve the composite scheduling problems.An improved representation based on random keys was developed to search permutation space.A genetic algorithm based dynamic programming approach was applied to select resource.The proposed technique and a previous technique are compared by three types of problems.All results indicate that the proposed technique is superior to the previous one. 相似文献
4.
We propose the spectrum allocation and resource scheduling algorithms in cognitive point to multipoint （PMP） networks with rapid changes of spectrum opportunities and present a media access control （MAC） protocol based on these algorithms. The objective of spectrum allocation is to make efficient use of the spectrum while maintaining the transceiver synchronization on frequency and time in the network. The objective of resource scheduling is to guarantee the quality of service （QoS） requirements of different kinds of connections and to minimize the total energy consumption in the network as well. By sensing only a small set of possible channels in each slot based on the state transition probability of each channel, our spectrum allocation algorithm achieves high spectrum efficiency in the network. The resource scheduling problem is divided into three sub problems and we derive optimal solutions to these problems by greedy algorithm and convex optimization. The simulation results show that our algorithm can make efficient use of the spectrum and the network resources at a cost of low computational complexity. 相似文献
5.
An optimal allocation of earth is of great significance to reduce the project cost and duration in the construction of rock-fill dams. The earth allocation is a dynamic system affected by various time-space constraints. Based on previous studies, a new method of optimizing this dynamic system as a static one is presented. In order to build a generalized and flexible model of the problem, some man-made constraints were investigated in building the mathematic model. Linear programming and simplex method are introduced to solve the optimization problem of earth allocation. A case study in a large-scale rock-fill dam construction project is presented to demonstrate the proposed method and its successful application shows the feasibility and effectiveness of the method. 相似文献
6.
This paper concerns with modeling and design of an algorithm for the portfolio selection problems with fixed transaction costs and minimum transaction lots. A mean-variance model for the portfolio selection problem is proposed, and the model is formulated as a non-smooth and nonlinear integer programming problem with multiple objective functions. As it has been proven that finding a feasible solution to the problem only is already NP-hard, based on NSGA-II and genetic algorithm for numerical optimization of constrained problems (Genocop), a multi-objective genetic algorithm (MOGA) is designed to solve the model. Its features comprise integer encoding and corresponding operators, and special treatment of constraints conditions. It is illustrated via a numerical example that the genetic algorithm can efficiently solve portfolio selection models proposed in this paper.This approach offers promise for the portfolio problems in practice. 相似文献
7.
Due to the complexity of earthwork allocation system for the construction of high concrete face rockfill dam,traditional allocation and planning are not able to function properly in the construction process with strong randomness.In this paper,the working mechanism of earthwork dynamic allocation system is analyzed comprehensively and a solution to fuzzy earthwork dynamic allocation is proposed on the basis of uncertain factors in the earthwork allocation of a hydropower project.Under the premise of actual situation and the experience of the construction site,an all-coefficient-fuzzy linear programming mathematical model with fuzzy parameters and constraints for earthwork allocation is established according to the structure unit weighted ranking criteria.In this way,the deficiency of certain allocation model can be overcome.The application results indicate that the proposed method is more rational compared with traditional earthwork allocation. 相似文献
8.
High-speed train communication system is a typical high-mobility wireless communication network. Resource allocation problem has a great impact on the system performance. However, conventional resource allocation approaches in cellular network cannot be directly applied to this kind of special communication environment. A multidomain resource allocation strategy was proposed in the orthogonal frequency-division multiple access （OFDMA） of high-speed. By analyzing the effect of Doppler shift, sub-channels, antennas, time slots and power were jointly consid- ered to maximize the energy efficiency under the constraint of total transmission power. For the purpose of reducing the computational complexity, noisy chaotic neural network algorithm was used to solve the above optimization problem. Simulation results showed that the proposed resource allocation method had a better performance than the traditional strategy. 相似文献
9.
《重庆大学学报(英文版)》2002,1(1):27-31
To solve the problem of investment portfolio with single goal of maximal NPV,10-1 programming model was proposed and proved effective;and to solve that concerning more elements of a project such as risk level and social benefit,a goal programming model is then introduced.The latter is a linear programming model adopting slack variable called deviation variable to turn inequation constraint into equation constraint,introducing a priority factor to denote different improtance of the goals.A case study has demonstrated that this goal programming model can give different results according to different priorty requirement of each objective. 相似文献
10.
Zhanying Ren Shijie Liu 《美中教育评论》2005,2(11):27-30
According to the requirement of modem teaching theory and technology, based on software engineering, database theory, the technique of net information security and system integration, a net testing system on local network was designed and realized. The system benefits for dividing of testing ＆ teaching and settles the problems of random testing paper. In this paper, system structure and main function, database designing, database programming and system integration and maintenance were introduced. 相似文献
11.
1IntroductionWe consider the following multi-di mensional nonlin-ear knapsack problem(MNKP)maxf(x)=∑nj=1fj(xj)s.t.gi(x)=∑nj=1gij(xj)≤bi,i=1,…,m,x∈X={x|lj≤xj≤uj,xjinteger,j=1,…,n},where allfjand allgijare nondecreasing functions ofxjon[lj,uj]forj=1,…,n,i=1,…,m,andljandujare integer lower and upper bounds forxj,re-spectively,j=1,…,n.It has been proved that0-1linear knapsack problemis NP-hard[1].Nonlinear knapsack problems have numerous appli-cations in various fields,for example,ca… 相似文献
12.
13.
王江荣 《兰州石化职业技术学院学报》2009,9(3):67-68
决策论中有一类人力资源分配问题,解决这类问题通用的方法是线性规划法.经过研究发现,这类问题具有阶段性、顺序性和可分离性.对该问题进行转化,给出了解决这类问题的动态规划算法.这类方法动态地揭示了决策者在优化人力资源方面的全过程,弥补了线性规划在处理这类问题中的不足(不能细化决策的全过程). 相似文献
14.
指出凸分析问题的两个定理（凹规划定理和对偶定理）的证明中所存在的漏洞,并给出正确的证明．首先,将凸集的端子集的概念推广到一般集合的端集,再利用推广后的端集正确地证明了凹规划定理．其次,给出局部凸空间的一个引理,并利用这个引理证明了共轭函数的对偶定理． 相似文献
15.
16.
胡英武 《金华职业技术学院学报》2011,11(3):86-88
数独是近年流行的一种益智游戏,其最常见模式是在一个n行×n列又再分成n区共n2个小格的方中,填入适当的数字,使每一行、每一列、每一区都含有数字1～n,不重复.运用0-1规划的方法建立数独问题的整数规划模型,给出了9阶数独模型求解的Lingo程序,最后对模型进行了评价。 相似文献
17.
广义凸规划的最优性条件 总被引：1，自引：1，他引：0
王艳 《内江师范学院学报》2009,24(10):30-32
把多目标规划问题转化为单目标规划问题,利用强伪不变凸函数和强拟不变凸函数,得出了在K-T条件下多目标规划问题（VP）（弱）有效解存在的存在性定理,并给出了相应的证明． 相似文献
18.
李智勇 《宁德师专学报(自然科学版)》2008,20(3):236-238
先把一般的非线性凸半定规划转化成目标函数是线性函数的非线性凸半定规划,然后用割平面算法求解转化后的半定规划．最后证明了割平面算法的收敛性． 相似文献
19.
动态规划在资源分配上的应用 总被引：2，自引：0，他引：2
目前动态规划在工程技术、经济管理、工业生产、交通运输等众多领域都有广泛的应用,其中资源分配问题是动态规划在管理领域的一个重要应用．在资源分配问题上使用动态规划,是将分配过程划分为多个阶段,在每一个阶段中选取其最优决策,最后达到整个过程的总体最优目标．详细阐述了动态规划算法的基本原理和解题步骤,并通过具体实例说明动态规划在资源分配方面解决问题的过程． 相似文献