Characteristics in optimization of CGH for array generator

A method of simulated annealing in optimization of a computer generated holo-gram(CGH)is presented.The characteristics of energy in annealing curve are analyzed.Thecooling schedule such as giving an initial temperature,the temperature function,the numberof interactions and stopping criterion are discussed.As an example,an optimization of phaserelief kinoform,a CGH with multiple phase levels,is implemented.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Preparation of Papers

We motivate the study of a vector variational inequality by a practical flow equilibrium problem on a network, namely a generalization of the well-known Wardrop equilibrium principle. Both weak and strong forms of the vector variational inequality are discussed and their relationships to a vector optimization problem are established under various convexity assumptions.     

灰色模型的最优化及其参数的直接求法

基于灰色模型的内涵表达式和白化方程响应式均为等比级数的观点,提出了一种不用求ago值、均值,不涉及灰色微分方程,白化微分方程概念,直接求灰色模型参数a,c的方法,通过此方法建立的新模型不仅从理论上可保证是在满足给定评价标准为模拟绝对误差平方和最小(或模拟相对误差平方和最小)、给定精度条件下的最优化模型,从而结束了灰色模型只有更优,没有最优的历史.并从理论上证明了新模型具有白化指数律重合性、白化系数律重合性,伸缩变换一致性.最后通过实例编程验证该方法具有可操作性,且预测精度高,效果好.     

CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION

By using cone-directed contingent derivatives, the unified necessary and suffi-cient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set valued optimization.     

The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs

We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values. Received: August 2001 / Accepted: January 2002?Published online March 27, 2002     

Scalarization for pointwise well-posed vectorial problems

The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class of scalar problems whose well-posedness properties are equivalent with the most known well-posedness properties of the original problem. Then a well-posedness property of a quasiconvex level-closed problem is derived.      

An integer goal programming model for hazardous waste treatment and disposal

The improper handling and disposal of hazardous wastes cause threats to human health and the environment. One reason for the improper handling and disposal of these wastes is that not much consideration is usually given to the logistical aspects of hazardous waste systems. In this paper an integer goal programming model is developed that takes into consideration the multiple goals and needs of many groups involved in managing and planning hazardous waste systems. The model can easily be implemented and can be used to address many of the issues related to facility location, recycling, treatment, and disposal of hazardous wastes.     

Contingent epiderivatives and set-valued optimization

In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions.     

重力输水管道优化设计方法研究

针对重力输水管道设计中存在的问题，文章以管道造价最小为目标，应用动态规划，提出了一种新的重力输水管道优化设计方法，对输水管的当量管径、流量分配、连接管设置与可靠性校核计算等问题作了探讨。该方法可用于沿线有节点流量流出的并联输水管道优化设计，能明显节省投资，有良好的实用性