利用整合区域特性约束提高孔隙率模拟精度

本文将空间结构变化的要求与动态资料确定的储量共同作为约束,建立了包含两个约束条件的目标函数, 应用模拟退火算法对孔隙率的空间分布进行预测。在实现过程中,通过初始控制参数的给定及目标函数修改提高了运算效率。由于目标函数有效地整合了静、动态信息,从而降低了模拟结果的不确定性．提高了模拟的精度。合成数据及实际数据的模拟试验表明,整合区域特性约束不仅提高了孔隙率模拟精度,而且算法收敛快、稳定性高。     

试论就业形势与战略

论述了就业的特殊重要性、目前我国就业形势的极端严重性，以及所应当采取的战略和措施。     

信息理解系统的结构及理解过程

主要讨论消息理解的基本模式及其信息理解系统，并且讨论了二类消息的语义理解例以及理解客观度．     

鱼雷罐喷粉预处理优化研究

在已经得到的描述鱼雷罐喷粉处理基本参数具体表达式的基础上，运用多目标非线性优化方法，对工艺操作参数进行优化。     

建筑师难以出精品之原因分析

指出当今建筑业良好的市场给建筑师们提供了展示自己作品的广大空间 ,但其精品却为之甚少。为此 ,对建筑业存在的一些问题及制约建筑师出精品的主、客观因素进行了分析 ,指出建筑师应提高自身素质 ,树立精品意识 ,增强市场竞争能力     

价格不确定情况下炼厂生产计划的优化

生产计划的编制是炼油企业生产经营管理中的一个关键环节，然而由于市场变化的不确定性，使企业制度长远规划受到限制，笔者将多目标规划应用于炼厂价格不确定情况下生产计划的制定，使所得到的生产计划在一定程度上反映市场的变化并能使企业的生产效益最优，为企业管理决策者进行长远规划给予指导。通过实例验证了该方法的可行性。     

区域水资源模糊多目标规划模型及求解

针对区域水资源系统规划的多目标性和各目标的不精确性，建立了区域水资源系统模糊多目标线性规划模型。该模型改变了以往按确定性目标进行优化的思路，只需要给定目标值一个范围，就可以在规定的目标范围内进行优化求解。在求解过程中，建立了以各模糊目标隶属度值最大化为目标的模糊目标规划模型，采用目标隶属函数正负偏差量变量替换的方法，用线性目标规划的方法求解。经过实例验证，该模型求解比较简单，求解结果合理，与普通规划结果相比水资源模糊目标规划在规定目标的范围内取得了更好的优化结果。     

The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a _i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q ^* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above.     

Partitioning multiple objective optimal solutions with applications in radiotherapy design

The optimal partition for linear programming is induced by any strictly complementary solution, and this partition is important because it characterizes the optimal set. However, constructing a strictly complementary solution in the presence of degeneracy was not practical until interior point algorithms became viable alternatives to the simplex algorithm. We develop analogs of the optimal partition for linear programming in the case of multiple objectives and show that these new partitions provide insight into the optimal set (both pareto optimality and lexicographic ordering are considered). Techniques to produce these optimal partitions are provided, and examples from the design of radiotherapy plans show that these new partitions are useful. A. Holder. Research conducted at Trinity University, TX, and The University of Mississippi, MS. This research was partially supported by ONR Grant N00014-01-1-0917.