Functional Equations and Quantum Separation of Variables for 3d Spin Models

The recently proposed invariant formulation of the auxiliary linear problem for 3d integrable models provides several new ideas for solving the spectral problem of 3d spin models, e.g., the Zamolodchikov–Bazhanov–Baxter model in its vertex formulation. This paper announces results following from the invariant formulation. We formulate the class of 3d spin models that are essentially appropriately parameterized inhomogeneous Zamolodchikov–Bazhanov–Baxter models, present an expression for the generating function of the complete set of matrices commuting with the transfer matrix of this model (integrals of motion), give the functional equations defining the eigenvalues of the integrals of motion and the transfer matrices, explicitly describe the groupoid of isospectral transformations of the initial system of integrals of motion, and finally give an explicit parameterization of a projection operator onto the separated states in the sense of the quantum separation of variables (functional Bethe ansatz).     

Integer programming formulation of combinatorial optimization problems

This paper considers in a somewhat general setting when a combinatorial optimization problem can be formulated as an (all-integer) integer programming (IP) problem. The main result is that any combinatorial optimization problem can be formulated as an IP problem if its feasible region S is finite but there are many rather sample problems that have no IP formulation if their S is infinite. The approach used for finite S usually gives a formulation with a relatively small number of additional variables for example, an integer polynomial of n 0?1 variables requires at most n + 1 additional variables by our approach, whereas 2ⁿ - (n + 1) additional variables at maximum are required by other existing methods. Finally, the decision problem of deciding whether an arbitrarily given combinatorial optimization problem has an IP formulation is considered and it is shown by an argument closely related to Hilbert's tenth problem (drophantine equations) that no such algorithm exists.     

财政支出、电力消费与农民收入的时空特征分析

本文将财政农业人均支出和农村人均用电量作为解释变量,农民人均纯收入作为被解释变量,利用2000-2005年中国31个省、市和自治区的有关时空数据,建立相应的空间自回归模型.模型数据统计分析表明:a)农民人均纯收入不仅存在空间自相关的特点,而且具有异质性;b)农民人均收入对财政农业人均支出、农村人均用电量存在明显的空间依赖性;c)用财政农业支出和农村用电量来反映农民收入水平十分有效,且都具有显著的正面影响.据此,文章提出了一些有针对性的提高农民收入的政策建议.     

A primal–dual algorithm for the economic lot-sizing problem with multi-mode replenishment

The classical economic lot-sizing problem assumes that a single supplier and a single transportation mode are used to replenish the inventory. This paper studies an extension of this problem where several suppliers and transportation modes are available. The decision-making process in this case involves identifying (i) the timing for an order; (ii) the choice of shipment modes; and (iii) the order size for each mode. The problem is defined as a network flow problem with multiple setups cost function and additional side constraints. This study provides an MIP formulation for the problem. We also provide an additional formulation of the problem by redefining its decision variables and show that the dual of the corresponding LP-relaxation has a special structure. We take advantage of the structure of the dual problem to develop a primal–dual algorithm that generates tight lower and upper bounds. Computational results demonstrate the effectiveness of the algorithm.     

A Multi-Class Dynamic User Equilibrium Model for Queuing Networks with Advanced Traveler Information Systems

This paper presents a formulation and solution algorithm for a composite dynamic user-equilibrium assignment problem with multi-user classes, in order to assess the impacts of Advanced Traveler Information Systems (ATIS) in general networks with queues. Suppose that users equipped with ATIS will receive complete information and hence be able to choose the best departure times and routes in a deterministic manner, while users not equipped with ATIS will have incomplete information and hence may make decisions on departure times and routes in a stochastic manner. This paper proposes a discrete-time, finite-dimensional variational inequality formulation that involves two criteria regarding the route and departure time choice behaviors, i.e., the deterministic dynamic user equilibrium and the nested logit-based stochastic dynamic user equilibrium. The formulation is then converted to an equivalent “zero-extreme value” minimization problem. A heuristic algorithm based on route/time-swapping process is proposed, which iteratively adjusts the route and departure time choices to reach closely to an extreme point of the minimization problem. A numerical example is used to demonstrate the effectiveness of the proposed approach for assessing the ATIS impacts such as changes in individual travel costs, departure times, route inflows, queuing peaks and total network travel cost. This revised version was published online in July 2006 with corrections to the Cover Date.     

A comparison of dynamic hazard models and static models for predicting the special treatment of stocks in China with comprehensive variables

The stock exchanges in China give a stock special treatment in order to indicate its risk warning if the corresponding listed company cannot meet some requirements on financial performance. To correctly predict the special treatment of stocks is very important for the investors. The performance of the prediction models is mainly affected by the selection of explanatory variables and modelling methods. This paper makes a comparison between the multi-period hazard models and five widely used single-period static models by investigating a comprehensive category of variables including accounting variables, market variables, characteristic variables and macroeconomic variables. The empirical result shows that the performance of the models is sensitive to the choice of explanatory variables but the performance between the multi-period hazard models and the single-period static models has no significant difference.     

Competitive facility location on decentralized supply chains

This paper addresses a novel competitive facility location problem about a firm that intends to enter an existing decentralized supply chain comprised of three tiers of players with competition: manufacturers, retailers and consumers. It first proposes a variational inequality for the supply chain network equilibrium model with production capacity constraints, and then employs the logarithmic-quadratic proximal prediction–correction method as a solution algorithm. Based on this model, this paper develops a generic mathematical program with equilibrium constraints for the competitive facility location problem, which can simultaneously determine facility locations of the entering firm and the production levels of these facilities so as to optimize an objective. Subsequently, a hybrid genetic algorithm that incorporates with the logarithmic-quadratic proximal prediction–correction method is developed for solving the proposed mathematical program with an equilibrium constraint. Finally, this paper carries out some numerical examples to evaluate proposed models and solution algorithms.     

An Iterative LP Algorithm for Quadratic Spatial Equilibria

This paper describes a partitioning algorithm based on the Benders decomposition to solve net import spatial equilibrium models. The method decomposes the problem into a linear master problem and a quadratic subproblem. It is shown that the quadratic subproblem is trivial, and the associated dual variables can be determined through ordinary calculus. Therefore, the quadratic spatial equilibrium problem is solved iteratively by using linear programming software.     

Mixed-integer quadratic programming

This paper considers mixed-integer quadratic programs in which the objective function is quadratic in the integer and in the continuous variables, and the constraints are linear in the variables of both types. The generalized Benders' decomposition is a suitable approach for solving such programs. However, the program does not become more tractable if this method is used, since Benders' cuts are quadratic in the integer variables. A new equivalent formulation that renders the program tractable is developed, under which the dual objective function is linear in the integer variables and the dual constraint set is independent of these variables. Benders' cuts that are derived from the new formulation are linear in the integer variables, and the original problem is decomposed into a series of integer linear master problems and standard quadratic subproblems. The new formulation does not introduce new primary variables or new constraints into the computational steps of the decomposition algorithm.The author wishes to thank two anonymous referees for their helpful comments and suggestions for revising the paper.     

Bayesian Variable Selection for Logistic Models Using Auxiliary Mixture Sampling

This article presents a Markov chain Monte Carlo algorithm for both variable and covariance selection in the context of logistic mixed effects models. This algorithm allows us to sample solely from standard densities with no additional tuning. We apply a stochastic search variable approach to select explanatory variables as well as to determine the structure of the random effects covariance matrix.

Prior determination of explanatory variables and random effects is not a prerequisite because the definite structure is chosen in a data-driven manner in the course of the modeling procedure. To illustrate the method, we give two bank data examples.     

带平衡约束的离散网络平衡设计问题的遗传算法

本文研究了带平衡约束的离散网络设计问题及其求解算法.模型中上层是一个离散网络设计的数学规划模型,采用遗传算法来求解.下层是采用变分不等式描述的用户平衡配流问题,利用对角化方法直接求解.通过实例对算法进行验证,结果表明该算法是有效的.     

Contributions to the quadratic assignment problem

Tree search procedures for solving the Koopmans Beckmann quadratic assignment problem (QAP) are unable to solve any reasonable size QAP's mainly because good quality lower bounds for this problem cannot be computed.The purpose of this paper is to propose a bounding technique based on the extraction from the QAP formulation, of a large linear assignment problem (which can then be solved optimally), leaving as a residual problem as ‘small’ a QAP as possible. The solution of this residual QAP can then be bounded by a separate procedure. This 2-step method produces improved bounds as compared with those produced by the direct application of the bounding algorithms to the original QAP. In addition, a procedure is described for the a priori fixing of variables in the QAP formulation, thus reducing the number of variables in the problem.     

Consistent aggregation of linear complementarity problems

Aggregating linear complementarity problems under a general definition of constrained consistency leads to the possibility of consistent aggregation of linear and quadratic programming models and bimatrix games. Under this formulation, consistent aggregation of dual variables is also achieved. Furthermore, the existence of multiple sets of aggregation operators is discussed and illustrated with a numerical example. Constrained consistency can also be interpreted as a disaggregation rule. This aspect of the problem may be important for implementing macro (economic) policies by means of micro (economic) agents.Giannini Foundation Paper No. 548.     

An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling

The minimization of weighted pedestrian and vehicle times for pedestrians dispersing at public gatherings is considered. An algorithm to solve this problem and to assign each pedestrian group to a unique selected path is developed. This algorithm considers general network where its arc values are dependent on pedestrian/traffic modelling and its nodes (intersections) have penalties.The algorithm is followed by a case study which exhibits possible pedestrian/traffic models. These experimental models yield some deterministic functional dependency between pedestrians' speed and sidewalk concentration, pedestrians' street concentration, and sidewalk concentration, and vehicles' speed and pedestrians' street concentration. If such and realistic models serve as an input to the algorithm it might contribute to reduce pedestrian/traffic conflicts and interference and hence to increase the overall safety of these two travel modes.     

An O(n) algorithm for the multiple-choice knapsack linear program

An algorithm for solving the linear program associated with the multiple choice knapsack problem is described. The algorithm is shown to work in time linear in the number of variables. This improves the previously known best bound for this problem, and is optimal to within a constant factor.     

A Bayesian Estimate of the Risk of Tick-Borne Diseases

The paper considers the problem of estimating the risk of a tick-borne disease in a given region. A large set of epidemiological data is evaluated, including the point pattern of collected cases, the population map and covariates, i.e. explanatory variables of geographical nature, obtained from GIS.The methodology covers the choice of those covariates which influence the risk of infection most. Generalized linear models are used and AIC criterion yields the decision. Further, an empirical Bayesian approach is used to estimate the parameters of the risk model. Statistical properties of the estimators are investigated. Finally, a comparison with earlier results is discussed from the point of view of statistical disease mapping.     

求解Nash均衡子问题的一个算法

n人有限博弈的混合策略组合（p1^*,…,pn^*)为Nash均衡,如果其中每一策略pi^*都是参与人i(i=1,2,…,n),对其它n-1个参与人策略组合（p1^*,…,pi 1^*,pi-1^*,…,pn^*)的最优反应,即存在n个概率向量p1^*,…,pn^*使得对i=1,2,…,n及任意k1维概率向量pi恒有vi(p1^*,…,pn^*…)小于vi(pi^*,…,pi-1^*,pi 1^*,…pn^*),其中vi为参与人i的支付函数,pi=(pil,…,piki)）为ki维概率向量,即满足条件,pij大于等于0,∑kij=1pij=1,ki是参与人i的策略空间中策略个数,i=1,2,…,n,由此,Nash均衡的求解可化为下列优化问题：求n个概率向量pi^*,…,pn^8,使得对i=1,2,…,n及任意ki维的概率向量pi满足maxxvi(P1^*,…,pi-1^*,pi,Pi 1^*,…,pn^*)=vi(P1^*,,…,Pn^*)。     

A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions

In this paper a new methodology is developed for the solution of mixed-integer nonlinear programs under uncertainty whose problem formulation is complicated by both noisy variables and black-box functions representing a lack of model equations. A branch-and-bound framework is employed to handle the integer complexity whereby the solution to the relaxed nonlinear program subproblem at each node is obtained using both global and local information. Global information is obtained using kriging models which are used to identify promising neighborhoods for local search. Response surface methodology (RSM) is then employed whereby local models are sequentially optimized to refine the problem’s lower and upper bounds. This work extends the capabilities of a previously developed kriging-response surface method enabling a wider class of problems to be addressed containing integer decisions and black box models. The proposed algorithm is applied to several small process synthesis examples and its effectiveness is evaluated in terms of the number of function calls required, number of times the global optimum is attained, and computational time.     

存在随机解释变量的平行数据模型的处理

本文研究了平行数据模型中存在随机解释变量的解决方法:构造了模型设定的假设检验,给出了参数的一致估计量,并通过建立山东省城镇家庭烟草消费额模型进行了实证分析.     

Aggregation of preferences: a review

This paper presents a review and a classification of the main theoretical results obtained up to now in the important field of the aggregation of preferences. (Let us mention that multicriteria analysis is not considered here, as it essentially consists of methods for the aggregation of preferences).Section 1 describes a tableau, each square of which corresponds to a particular type of preference aggregation problem, and gives, for each of them, a list of references. The different types of problems are obtained by considering the various kinds of informations which can be obtained concerning the global preferences of a committee and the preferences of the individual members.Sections 2, 3 and 4 present some comments respectively on Arrow's problem (three first columns of the tableau), on the theory of choice functions (fourth column) and voting procedures (fifth column).In the bibliography, each reference is associated, in terms of its subject, to one particular square of the tableau.