基于投入产出方法的中国城乡居民收入分析

目前居民收入分配问题,特别是城乡居民收入差距问题已成为中国社会面临的需要高度重视和尽快解决的问题.在2007年全国投入产出表的基础上,利用多个部门的相关数据将我国居民收入划分为农村居民收入和城镇居民收入两个收入群体,对两个群体在各部门的收入分配情况进行了分析.同时,利用投入产出局部闭模型和宫泽乘数方法,对农村居民收入和城镇居民收入之间的拉动关系以及各部门最终需求的变动对农村和城镇居民收入的影响进行了定量分析.     

A Dynamic Supplier Selection and Inventory Management Model for a Serial Supply Chain with a Novel Supplier Price Break Scheme and Flexible Time Periods

A new supplier price break and discount scheme taking into account order frequency and lead time is introduced and incorporated into an integrated inventory planning model for a serial supply chain that minimizes the overall incurred cost including procurement, inventory holding, production, and transportation. A mixed-integer linear programming (MILP) formulation is presented addressing this multi-period, multi-supplier, and multi-stage problem with predetermined time-varying demand for the case of a single product. Then, the length of the time period is considered as a variable. A new MILP formulation is derived when each period of the model is split into multiple sub-periods, and under certain conditions, it is proved that the optimal solution and objective value of the original model form a feasible solution and an upper bound for the derived model. In a numerical example, three scenarios of the derived model are solved where the number of sub-period is set to 2, 3, and 4. The results further show the decrease of the optimal objective value as the length of the time period is shortened. Sufficient evidence demonstrates that the length of the time period has a significant influence on supplier selection, lot sizing allocation, and inventory planning decisions. This poses the necessity of the selection of appropriate length of a time period, considering the trade-off between model complexity and cost savings.     

Material compatibility constraints for make-to-order production planning

This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope.     

Derivative evaluation and computational experience with large bilevel mathematical programs

A bilevel program is a mathematical program involving functions defined implicitly as solutions to another mathematical program. We discuss a method for extracting derivative information on the implicit function, which is especially efficient when the lower-level problem has simple bounds on the variables and/or many inactive constraints. Computational experience on problems with up to 230 variables and 30 constraints is presented.Computational support from Robert Bivins and Myron Stein is gratefully acknowledged. We have also appreciated comments from Jon Bard and an anonymous referee. This work was supported in part by the US Department of Energy through the Los Alamos National Laboratory.     

Dynamic motion planning in low obstacle density environments

A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space (Van der Stappen et al., 1997). In this paper we address the dynamic version of the motion planning problem in which a robot moves among polygonal obstacles which move along polylines. The obstacles are assumed to move along constant complexity polylines, and to respect the low density property at any given time. We will show that in this situation a cell decomposition of the free space of size O(n²(n) log² n) can be computed in O(n²(n) log² n) time. The dynamic motion planning problem is then solved in O(n²(n) log³ n) time. We also show that these results are close to optimal.     

Water resources planning based on complex system dynamics: A case study of Tianjin city

A complex system dynamic (SD) model focusing on water resources, termed as TianjinSD, is developed for the integrated and scientific management of the water resources of Tianjin, which contains information feedback that governs interactions in the system and is capable of synthesizing component-level knowledge into system behavior simulation at an integrated level, thus presenting reasonable predictive results for policy-making on water resources allocation and management. As for the Tianjin city, interactions among 96 components for 12 years are explored and four planning alternatives are chosen, one of which is based on the conventional mode assuming that the existing pattern of human activities will be prevailed, while the others are alternative planning designs based on the interaction of local authorities and planning researchers. Optimal mode is therefore obtained according to different scenarios when compared the simulation results for evaluation of different decisions and dynamic consequences.     

Local characterization of invariant sets of an autonomous differential inclusion

Summary An application in robotics motivates us to characterize the evolution of a subset in state space due to a compact neighborhood of an arbitrary dynamical system—an instance of a differential inclusion. Earlier results of Blagodat·skikh and Filippov (1986) and Butkovskii (1982) characterize the boundary of theattainable set and theforward projection operator of a state. Our first result is a local characterization of the boundary of the forward projection ofa compact regular subset of the state space. Let the collection of states such that the differential inclusion contains an equilibrium point be called asingular invariant set. We show that the fields at the boundary of the forward projection of a singular invariant set are degenerate under some regularity assumptions when the state-wise boundary of the differential inclusion is smooth. Consider instead those differential inclusions such that the state-wise boundary of the problem is a regular convex polytope—a piecewise smooth boundary rather than smooth. Our second result gives conditions for theuniqueness andexistence of the boundary of the forward projection of a singular invariant set. They characterize the bundle of unstable and stable manifolds of such a differential inclusion.     

Multi-product production planning: A goal programming approach

Cost minimization multi-product production problems with static production resource usage and internal product flow requirements have been solved by linear programming (LP) with input/output analysis. If the problem is complicated by interval resource estimates, interval linear programming (ILP) can be used. The solution of realistic problems by the above method is cumbersome. This paper suggests that linear goal programming (LGP) can be used to model a multi-product production system. LGP's unique modeling capabilities are used to solve a production planning problem with variable resource parameters. Input/output analysis is used to determine the technological coefficients for the goal constraints and is also used to derive an information sub-model that is used to reduce the number of variable resource goal constraints. Preliminary findings suggest that the LGP approach is more cost-efficient (in terms of CPU time) and in addition provides valuable information for aggregate planning.     

Domestic crude oil resource appraisal

This paper endeavours to estimate the cummulative level of discovery and production of crude oil in the United States where the importance of price and technological change is considered. Two separate functional specifications for the cumulative level are hypothesized and estimated. The results suggest that between 170 and 180 billion barrels will be ultimately recoverable of which 117 billion barrels have been produced through the end of 1989.     

Two-phase optimization of coal strategies at a power station

Development of optimal coal mining and stockpiling strategies for a new 960 MW thermal power station depends strongly on the operation of New Zealand's mixed hydro/thermal power system. To overcome the large dimensionality of the problem the optimization proceeds in two phases for each future scenario studied. Phase 1 finds optimal hydro operating strategies with thermal generation in merit order of marginal fuel costs. It uses stochastic dynamic programming. The hydro generating strategies are used as input to the phase 2 stochastic simulation of the coal mining and stockpiling operation at the new thermal station. Finally, a strategy is identified which is a priori best over all future scenarios of industrial development and oil prices studied.