基于Gristensen算法的砂岩储层横波速度计算方法

由于横波测量成本高,大部分油田测井资料中仅有少部分横波数据,则依据常规测井资料准确构建横波曲线已成为关键.考虑到横波构建理论方法更多地依赖实验室分析资料,提出在Gristensen经验公式基础上,以研究区横波测量曲线为约束,通过优化反演确立公式系数是一种好的研究思路.优化方法实现中采用阻尼型高斯牛顿法,保障了多参数优化迭代的收敛性和精度.将研究方法用于卫星油田横波数据构建中,取得好的计算结果.     

A survey of multicriteria optimization or the vector maximum problem,part I: 1776–1960

In this survey, the history of the subject from 1776 until 1960 is presented. A brief biographical sketch of Vilfredo Pareto is given first. Then, the more or less simultaneous development of the concepts of utility, preference, and welfare theory follows, with results which go back to Hausdorff and Cantor. A brief discussion of the work of Borel and von Neumann as initiators of game theory is included. Each of these areas has developed enough to warrant its own survey; hence, they are reviewed here only insofar as they provide necessary foundations. Thereafter, the concepts of efficiency, vector maximum problem, and Pareto optimality are reviewed in connection with production theory, programming, and economics. The survey is presented within a unified mathematical framework, and the emphasis is on mathematical results, rather than psychological or socio-economic discussion. To enable the reader to draw conclusions without having to obtain each article himself, the results have been presented in somewhat more detail than usual.     

关于Diophantine方程(20n)x+(21n)y=(29n)z

设a,b,c是满足条件a2+ b2=c2的两两互素的正整数.Jesmanowicz于1956年猜想对于任意给定的正整数n,方程(an)x+(bn)y=(cn)z仅有解(x,y,z)=(2,2,2).本文证明了方程(20n)x+(21n)y=(29n)z有唯一解(x,y,z)=(2,2,2).     

Multipolar routing: where dynamic and static routing meet

Assuming that the traffic matrix belongs to a polytope, we describe a new routing paradigm where each traffic matrix is routed a combination of a number of extreme routings. This combination depends on the current traffic matrix. Multipolar routing can be seen as a generalization of both routing and robust static routing. Moreover, the time complexity of multipolar routing is under control since it depends on the number of poles (i.e. the number of extreme routings) which can be defined by the network planner     

Robust Optimization for the Connected Facility Location Problem

In this paper we present a robust optimization (RO) model for the Connected Facility Location (ConFL) problem within the framework introduced by Bertsimas and Sim [Bertsimas, D. and M. Sim, Robust discrete optimization and network flows, Mathematical Programming 98 (2003), pp. 49–71], and show how to use a heuristic in conjunction with a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bound mechanism within this RO approach decreases significantly its computational time and broadens its applicability to other NP-hard problems. Here we present some of our computational results that attest to the efficiency of the approach, particularly on the Robust ConFL problem.     

Polyhedral studies on the convex recoloring problem

A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We show an integer programming formulation for the weighted version of this problem on arbitrary graphs, and then specialize it for trees. We study the facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation, present several classes of facet-defining inequalities and discuss separation algorithms.     

能耗强度与能源结构优化对内生经济增长影响研究

本文在垂直创新模型框架下,将能耗强度和碳减排比例引入生产函数,将人们对气候变化的警惕意识引入效用函数,建立了一个动态的内生低碳经济增长模型。通过求解所建动态优化模型,找到了经济长期均衡增长的最优路径,讨论了能源强度和能源消费结构变化与经济均衡增长的相互关系,分析了各参数对经济最优增长路径的影响,比较了化石能源内部消费结构不变和逐年清洁两种情景下的经济最优增长路径的异同。长期来看,能源强度、二氧化碳减排速率与经济增长率有相互的负向线性关系,缩小反映化石能源内部消费结构的综合碳排放系数对经济增长有促进作用。非化石能源比例越高,低碳技术应用越广泛,研发成果对技术积累的贡献率越大,消费者对当前消费的偏好程度越小,人们对气候变化的警惕意识越强,则越有利于经济的低碳发展。     

Convergence of the BFGS-SQP Method for Degenerate Problems

In this paper, we propose a BFGS (Broyden–Fletcher–Goldfarb–Shanno)-SQP (sequential quadratic programming) method for nonlinear inequality constrained optimization. At each step, the method generates a direction by solving a quadratic programming subproblem. A good feature of this subproblem is that it is always consistent. Moreover, we propose a practical update formula for the quasi-Newton matrix. Under mild conditions, we prove the global and superlinear convergence of the method. We also present some numerical results.