微积分一种重要类型极限的计算方法

给出了一种类型函数极限运算的公式及其在微积分极限计算中的具体应用,应用此极限公式可以求某些极限运算中参数的值,给出一元函数在某一点连续的充分条件和求一个曲线的渐近线,同时提供了一个命题的证明方法.     

主范式的运算性质

研究了极大项、极小项的运算性质 ,利用这些性质给出了求 A,A∨ B,A∧ B,A→ B,A B的主范式的公式 ,由此可用程序化的方法求任意公式的主范式 .     

A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

关于数理逻辑在解决数学命题中的探讨

在解决、论证数学命题过程中 ,准确使用逻辑思维方法 ,可使具体解题步骤严谨周密 ,条理清晰 ,形成完整的推理体系     

Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems

This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP for the case when these problems are modeled with algebraic equations and inequalities. Since algebraic representations have some limitations such as difficulty of formulation and numerical singularities for the nonlinear case, we consider logic-based modeling as an alternative approach, particularly Generalized Disjunctive Programming (GDP), which the authors have extensively investigated over the last few years. Solution strategies for GDP models are reviewed, including the continuous relaxation of the disjunctive constraints. Also, we briefly review a hybrid model that integrates disjunctive programming and mixed-integer programming. Finally, the global optimization of nonconvex GDP problems is discussed through a two-level branch and bound procedure.     

居加猜想的一个等价命题

文章利用数论中的一些简单结果,建立了居加猜想的一个等价命题。     

Representations of unbounded optimization problems as integer programs

Any optimization problem in a finite structure can be represented as an integer or mixed-integer program in integral quantities.We show that, when an optimization problem on an unbounded structure has such a representation, it is very close to a linear programming problem, in the specific sense described in the following results. We also show that, if an optimization problem has such a representation, no more thann+2 equality constraints need be used, wheren is the number of variables of the problem.We obtain a necessary and sufficient condition for a functionf:SZ, withS Z ⁿ , to have a rational model in Meyer's sense, and show that Ibaraki models are a proper subset of Meyer models.This research was supported by NSF Grant No. GP-37510X1 and ONR Contract No. N00014-75-C0621, NR047-048.     

关于W.H.Young不等式形式的探讨

通过一个命题的证明，得出关于W．H．Young不等式的另一种形式，并说明这种形式的不必要性，借此来说明W．H．Young不等式形式的内在统一性和数学思维的严密性。     

P-n-右析取语言的相关性质

主要研究了P-n-右析取语言的一些相关性质，给出了P-n-析取辖的定义，得出了P-n-析取辖是稠密语言等结论。     

互逆蕴涵命题的空间曲线投影柱面表示

互逆主义逻辑是建立在解析几何的基础之上的。在空间解析几何中,空间曲线是两曲面的交线,在空间曲线中消去一元,即得投影柱面。与此类似,在互逆主义逻辑中,互逆蕴涵命题前件的两个合取支为两个曲面,它们的合取为空间曲线,若后件所表示的曲面恰为或真包含该空间曲线的投影柱面,则该互逆蕴涵命题成立,否则不成立。