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.     

凹整数规划的分枝定界解法

凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

Corrected mirror systems with double reflection

We propose objectives consisting of two mirrors with central holes for passage of a light beam. The optical layout ensures multiple reflection of rays from both mirrors. We consider several approaches to calculating the design parameters for which three and four aberrations do not occur. The objectives can be used in optical devices operating in the UV and IR regions of the spectrum. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 267–270, March–April, 2007.     

凹角区域双曲外问题的精确人工边界条件

研究一类凹角区域双曲型外问题的数值方法.先用Newmark方法对时间进行离散化,在每个时间步求解一个椭圆外问题.然后引入人工边界,并获得精确的人工边界条件.给出半离散化问题的变分问题,证明了变分问题的适定性,并给出了误差估计.最后给出数值例子,以示该方法的可行性与有效性.     

A Convenient Synthetic Method of Metal Dendritic Porphyrins

Metal porphyrins are natural antioxidant reagent1-3. However, due to the characteristics of structures, they are only soluble in inorganic acids and part of polar organic solvents. Thus, it is limited to be used as effective pharmaceutical preparations. T…     

解可分离约束双凹规划问题的一种外逼近方法[英文]

在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件，并构造了一个有限终止外逼近算法。     

The Generalized KKM Map and Its Applications to Variational Inequalities

In this paper,applying the concept of generalized KKM map,we study problems ofvariational inequalities.We weaken convexity(concavity)conditions for a functional of two variables■(x,y)in the general variational inequalities.Last,we show a proof of non-topological degree meth-od of acute angle principle about monotone operator as an application of these results.     

A Finite Algorithm for Global Minimization of Separable Concave Programs

Researchers first examined the problem of separable concave programming more than thirty years ago, making it one of the earliest branches of nonlinear programming to be explored. This paper proposes a new algorithm that finds the exact global minimum of this problem in a finite number of iterations. In addition to proving that our algorithm terminates finitely, the paper extends a guarantee of finiteness to all branch-and-bound algorithms for concave programming that (1) partition exhaustively using rectangular subdivisions and (2) branch on the incumbent solution when possible. The algorithm uses domain reduction techniques to accelerate convergence; it solves problems with as many as 100 nonlinear variables, 400 linear variables and 50 constraints in about five minutes on an IBM RS/6000 Power PC. An industrial application with 152 nonlinear variables, 593 linear variables, and 417 constraints is also solved in about ten minutes.     

含三个硬脂酰胺基的树枝状季铵盐的制备

由三羟甲基丙烷三丙烯酸酯(TMPTA)和乙二胺(EDA)直接进行M ichael加成反应,合成端基为3个NH2的树枝状大分子G(NH2)3,用硬脂酰氯将其端氨基进行酰胺化得到端基为3个硬脂酰基的树枝状大分子GS(R)3,产率为82.4%。GS(R)3进一步与碘甲烷反应,其分子中的3个仲氨基被季铵化,生成树枝状季铵盐GI(R)3,产率为82.0%。讨论了反应温度、反应时间和原料配比对GS(R)3和GI(R)3产率的影响,并用红外、核磁和元素分析对GS(R)3和GI(R)3的结构进行表征。