Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

有限时滞微分系统依照双测度的实际稳定性

本文对具有有限时滞的泛函微分方程建立了关于依照两种测度的实际稳定性的Razumikhin型判定定理，其中未采用通常的辅助函数，且可运用多个含有状态变量x的部分变元的Lyapunov函数，得出部分变远实际稳定性的判定定理，从而改进了已有的结果。     

On a result of Ozawa concerning uniqueness of meromorphic functions

In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

作业成本法数学模型的创新

随着企业产品价格竞争愈演愈烈，成本的合理分配、计算日显重要，但在间接费用的分摊上，传统成本会计对成本信息反映失真的局限性日益显露，会计理论界和实务界开始寻求一种新的准确的成本计算方法，作业成本法应运而生。本将由作业成本法基本原理推导出其数学模型，并将对其数学模型进一步改进，建立比较数学模型。使作业成本法向实际应用更进一步。     

上市公司资本成本面板数据模型与实证分析

本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.