A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost

This paper addresses a method for solving two classes of production-transportation problems with concave production cost. By exploiting a special network structure both problems are reduced to a kind of resource allocation problem. It is shown that the resultant problem can be solved by using dynamic programming in time polynomial in the number of supply and demand points and the total demand.The author was partially supported by Grand-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. (C)05650061.     

基于多Agent系统的项目调度研究

近年来 ,大型项目特别是大型工程项目存在如下的发展趋势 :1 )项目规模越来越大 ;2 )项目的复杂程度不断增加 ;3 )项目必须由多方合作才能完成 .本文针对上述特点 ,提出了基于多 Agent系统 (MAS:Multi-Agent Systems)解决资源约束条件下的项目调度问题 (RCPSP:Resource Constrained ProjectScheduling Problems)的方法 ,并通过实例项目对所提出的算法进行了验证 .     

THE COSTATE VARIABLE IN A STOCHASTIC RENEWABLE RESOURCE MODEL

ABSTRACT. In this paper we discuss the costate variable in a stochastic optimal control model of a renewable natural resource, which we call a fishery. The role of the costate variable in deterministic control models has been discussed extensively in the literature. See for example Lyon [1999], Clark [1990, pp. 102 107] and Arrow and Kurz [1970, pp. 35 37]; however, there is little discussion of this variable for stochastic models, even though thecostate variable has similar roles in the two models. In both models the costate variableis a shadow value of the associated state variable, and as such has the role of rationingthe use of the state variable. In addition, as has been shown in Lyon [1999], in natural resource problems the costate variable can be partitioned into a scarcity effect and a cost effect. We show that this same partitioning can be done in the stochastic renewable resource problem. We discuss and contrast the similarities and differences in these concepts for deterministic and stochastic models. In addition, we present a numerical example to help solidify the results.     

Internet中数学学术资源的利用

从工作实践出发 ,对 Internet上具有权威性、实用性的数学学术信息资源及相关机构的网址进行了介绍与评价 ,为数学研究人员及工作者提供 Internet中索取学术信息资源的线索 .     

教育资源语义模型研究

针对电子学习系统中实现教育资源智能搜索与整合的要求，提出了一个运用语义Web技术建立的教育资源语义模型，通过资源的内容、上下文、结构3个层次上元数据描述与相应本体的构建，可形成不同层次概念的抽象与层次结构，以实现对资源描述共享语义的理解和互操作．     

关于“光学工程”学科课程建设的几点思考

简要地论述了目前国内光学工程教学现状,分析了在光学工程教学与科研领域中处于一流地位的多所美国大学的教学方式,如亚利桑那大学、罗切斯特大学以及加州大学等,仔细研究了它们关于光学工程学科的课程设置、教学大纲和教学课件。结合作者在教学中的实际体会,对国内的光学工程学科的大学教学提出了几点建议,即师生共享教学大纲,注重实验与工程,丰富网络资源。     

The physics of accelerator driven sub-critical reactors

In recent years, there has been an increasing worldwide interest in accelerator driven systems (ADS) due to their perceived superior safety characteristics and their potential for burning actinides and long-lived fission products. Indian interest in ADS has an additional dimension, which is related to our planned large-scale thorium utilization for future nuclear energy generation. The physics of ADS is quite different from that of critical reactors. As such, physics studies on ADS reactors are necessary for gaining an understanding of these systems. Development of theoretical tools and experimental facilities for studying the physics of ADS reactors constitute important aspect of the ADS development program at BARC. This includes computer codes for burnup studies based on transport theory and Monte Carlo methods, codes for studying the kinetics of ADS and sub-critical facilities driven by 14 MeV neutron generators for ADS experiments and development of sub-criticality measurement methods. The paper discusses the physics issues specific to ADS reactors and presents the status of the reactor physics program and some of the ADS concepts under study.      

Negotiation and Equilibria in User Competition for Resources: A Dynamic Plot Approach

We consider a scenario where two users are competing for substitutable facilities and where the costs to a user for using a facility depend on its usage as well as the usage by the other user. This results in a nonlinear dynamic game the solution of which implies an allocation that satisfies both users. Games with four different types of solution spaces are presented where the equilibria and the process to reach a negotiated compromise solution have different characterizations. Nash equilibria and nondominated points are discussed in this context and an interactive graphical dynamic plot approach is presented for obtaining negotiated solutions in such nonlinear dynamic games.     

The Logic of Organizational Markets: Thinking Through Resource Partitioning Theory

Resource partitioning theory claims that Increasing concentration enhances the life chances of specialist organizations. We systematically think through this theory, specify implicit background assumptions, sharpen concepts, and rigorously check the theory's logic. As a result, we increase the theory's explanatory power, and claim—contrary to received opinion'that under certain general conditions, resource partitioning and the proliferation of specialists can take place independently of organizational mass and relative size effects, size localized competition, diversifying consumer tastes, increasing number of dimensions of the resource space, and changing niche widths. Our analysis makes furthermore clear that specialist and generalist strategies are asymmetric, and shows that not concentration enhances the life chances of specialists but economies of scale instead. Under the conditions explicated, we argue that if scale economies come to dominate, the number of organizations in the population increases, regardless of the incumbents' sizes.     

Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows

In this paper, the multi-mode resource constrained project scheduling problem with discounted cash flows is considered. The objective is the maximization of the net present value of all cash flows. Time value of money is taken into consideration, and cash in- and out-flows are associated with activities and/or events. The resources can be of renewable, nonrenewable, and doubly constrained resource types. Four payment models are considered: lump sum payment at the terminal event, payments at prespecified event nodes, payments at prespecified time points and progress payments. For finding solutions to problems proposed, a genetic algorithm (GA) approach is employed, which uses a special crossover operator that can exploit the multi-component nature of the problem. The models are investigated at the hand of an example problem. Sensitivity analyses are performed over the mark up and the discount rate. A set of 93 problems from literature are solved under the four different payment models and resource type combinations with the GA approach employed resulting in satisfactory computation times. The GA approach is compared with a domain specific heuristic for the lump sum payment case with renewable resources and is shown to outperform it.