首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8篇
  国内免费   1篇
  数学   9篇
  2018年   1篇
  2014年   1篇
  2013年   1篇
  2010年   1篇
  2009年   1篇
  2007年   2篇
  2006年   1篇
  2005年   1篇
排序方式: 共有9条查询结果,搜索用时 81 毫秒
1
1.
研究有预算限制的最大多种物资流问题,给出了这个问题的不依赖物资数k的全多项式时间近似算法,其算法复杂性是O~(-ε2m2).同时,利用有预算限制的最大多种物资流问题的研究结果,我们也得到了费用最小的最大多种物资流问题的近似算法和算法复杂性.  相似文献
2.
本文讨论了约束乘积最大问题最优解的结构特征,在此基础上给出了一个计算时间为O(n2)的强多项式时间算法,并且对于单边约束的情形给出了复杂度更低(O(nlnn))的强多项式时间算法.  相似文献
3.
System reliability, especially for serial parallel systems, has attracted much attention in recent years. Redundancy allocation is a technique to increase the reliability of the serial parallel systems. Supplying redundant components depends on some restrictions such as available budget, weight, space, etc. This paper proposes a new model for redundancy allocation problems (RAPs) by considering discount policy. The proposed model attempts to maximize the reliability of a system by gathering various components where there are some limitations on budgeting. We present two models with different assumptions including all unit discount and incremental discount strategies. The resulted formulations are nonlinear integer models and categorized as NP-hard. Therefore, some heuristics and meta-heuristics are designed to solve the resulted models, efficiently.  相似文献
4.
This paper considers the multi-product newsboy problem with both supplier quantity discounts and a budget constraint, while each feature has been addressed separately in the literature. Different from most previous nonlinear optimization models on the topic, the problem is formulated as a mixed integer nonlinear programming model due to price discounts. A Lagrangian relaxation approach is presented to solve the problem. Computational results on both small and large-scale test instances indicate that the proposed algorithm is extremely effective for the problem. An extension to multiple constraints and preliminary computational results are also reported.  相似文献
5.
In 1997, Roy and Maiti developed a fuzzy EOQ model with fuzzy budget and storage capacity constraints where demand is influenced by the unit price and the setup cost varies with the quantity purchased [T.K. Roy, M. Maiti, A fuzzy EOQ model with demand-dependent unit cost under limited storage capacity, Eur. J. Oper. Res. 99 (1997) 425–432]. However, their procedure has some questionable points and their numerical examples contain rather peculiar results. The purpose of this paper is threefold. First, for the same inventory model with fuzzy constraints, based on the max–min operator, we proposed an improved solution procedure. Second, we review the solution procedure by Roy and Maiti that is based on Kuhn–Tucker approach to point out their questionable results. Third, we compare Roy and Maiti’s approach with ours to explain why our approach can solve the problem and theirs cannot. Numerical examples provided by them also support our findings.  相似文献
6.
It is an important issue to design some performance indexes in order to measure the performance for a telecommunication network. Network analysis is an available approach to solve the performance problem for a real-life system. We construct a two-commodity stochastic-flow network with unreliable nodes (arcs and nodes all have several possible capacities and may fail) to model the telecommunication network. In which, all types of commodity are transmitted through the same network simultaneously and compete the capacities. This paper defines the system capacity as a 2-tuple vector, and then proposes a performance index, the probability that the upper bound of the system capacity equals a demand vector subject to the budget constraint. An upper boundary point is a vector representing the capacities of arcs and nodes, and is the maximal vector exactly meeting the demand vector. A simple algorithm based on minimal cuts (or named MC-based algorithm) is then presented to generate all upper boundary points in order to evaluate the performance index. The storage and computational time complexity of this algorithm are also analyzed. The performance evaluation for the multicommodity case can be extended easily.  相似文献
7.
From the quality management and decision making view point, reliability and unreliability are important indices to measure the quality level for a stochastic-flow network. In a multicommodity stochastic-flow network with unreliable nodes, the branches and nodes all have several possible capacities and may fail. Different types of the commodity, which are transmitted through the same network simultaneously, compete the capacities of branches and nodes. In this paper we first define the system capacity as a vector for a multicommodity stochastic-flow network with unreliable nodes. Then we design a performance index which is the probability that the upper bound of the system capacity is a given pattern subject to the budget constraint. It can be applied to evaluate the quality level for such a network. A simple approach based on minimal cuts is thus presented to evaluate the performance index.  相似文献
8.
研究在资源和预算约束条件下允许外购的多产品报童问题.为解决因资源有限而引起的缺货问题,允许外购,外购的最大可得到量是给定的.建立了在非零延迟时间外购情况下以求总体花费最小值为目标函数的的优化模型,分析了模型的结构特征,结合最优化理论,利用可行方向方法对模型进行了求解.数值结果表明了模型的合理性和算法的有效性.  相似文献
9.
In this paper a class of infinite horizon optimal control problems with an isoperimetrical constraint, also interpreted as a budget constraint, is considered. Herein a linear both in the state and in the control dynamic is allowed. The problem setting includes a weighted Sobolev space as the state space. For this class of problems, we establish the necessary optimality conditions in form of a Pontryagin Type Maximum Principle including a transversality condition. The proved theoretical result is applied to a linear–quadratic regulator problem.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号