多目标最优化G-恰当有效解集的存在性和连通性

本文证明了非空紧凸集上拟凸多目标最优化问题的G-恰当有效解的存在性．在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的G-恰当有效解集是连通的结论．同时，还给出一个关于Pareto有效解集连通性的新结果．     

点集映射的半连续性与Pareto有效点集的连通性

在研究多目标规划的有效解集的连通性时，许多文献通过将集合的有效点集表示为某个连通集上闭的点集映射的象集以得到结果．本文通过反例说明了连通集上闭的点集映射的象集未必是连通集，从而揭示了多目标规划有效解集连通性研究中存在的问题．据此，借助于点集映射的上半连续性，本文给出了集合的Pareto有效点集和Pareto弱有效点集的另一形式的连通性结果．     

ε- 扩展锥和多目标规划的 ε- 恰当有效性

本文引进Banach空间中的ε-扩展集和ε-扩展锥概念．借助ε-扩展锥,定义了多目标规划问题的ε-恰当有效解和局部ε-恰当有效解,并且研究了这些解的性质．此外还讨论了ε-恰当有效解与某些其它恰当有效解的关系．     

约束锥扰动多目标规划锥有效解集的闭性和半连续性

本文研究拓扑向量空间中目标映射和约束映射均为连续,约束映射的约束锥为半连续的条件下,受扰动可达目标集的锥有效点集和锥弱有效点集的闭性、半连续性和锥半连续性.在此基础上,得到了约束锥扰动多目标规划问题的锥有效解集和锥弱有效解集的闭性和半连续性.     

多目标最优化恰当有效解的稳定性

主要研究当两种类型的参数扰动时,多目标最优化问题中恰当有效解的稳定性.在点集映射的连续性意义下,分析讨论这种稳定性问题并分别给出引起扰动的两参数u,v所对应的点集映射Q1(u)和Q2(v),同时严格证明了在两个闭凸锥U,V上Q1(u)和Q2(v)的连续性定理.最后,通过附注对其进行补充和改进.     

有效解集的自动生成方法

本根据多目标规划有效解集的特性,应用神经网络的逼近和分类功能,建立了多目标规划有效解集的自动生成方法,证明了有关定理,给出了应用示例。     

多目标规划ακ-较多有效解集的连通性

本文首先讨论多目标规划问题中带参数的ακ-较多有效解集和最优解集的有关性质.在此基础上,研究向量目标函数在Hακ-拟凸的条件下多目标规划问题的有效解集和最优解集的连通性.     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性

本文研究局部凸的Hausdorff拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题。利用广义鞍点定理,证明了目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的。     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

锥拟凸与拓扑向量空间多目标最优化有效解集和弱有效解集的连通性

§1.引言多目标最优化的有效解集和弱有效解集的连通性问题,是多目标最优化研究中一个引入关注的重要课题.研究连通性的原因之一,是由于在多目标最优化的一些算法中,人们有时要依照某些辅助判据从解集中的一个解过渡到另一个解.这时,解集的连通性就能保证这种过渡始终是在所考虑的解集之中进行的.     

一类G-(F,ρ)凸多目标分式规划的最优性条件

本文讨论了一类多目标分式规划问题，其中所包含的函数是局部Lipschitz的和Clarke次可微的．首先，在G-(F，ρ)凸的条件下，证明了择一定理．然后，证明了该多目标分式规划问题在Geoffrion意义下的真有效解的充分条件和必要条件．     

A graphical characterization of the efficient set for?convex multiobjective problems

In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective problem is derived. This characterization takes into account the relative position of the gradients of the objective functions and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective problems is derived, which consists of solving a single linear optimization problem.     

Existence of efficient solutions for vector maximization problems

The vector maximization problem arises when more than one objective function is to be maximized over a given feasibility region. The concept of efficiency has played a useful role in analyzing this problem. In order to exclude efficient solutions of a certain anomalous type, the concept of proper efficiency has also been utilized. In this paper, an examination of the existence of efficient and properly efficient solutions for the vector maximization problem is undertaken. Given a feasible solution for the vector maximization problem, a related single-objective mathematical programming problem is investigated. Any optimal solution to this program, if one exists, yields an efficient solution for the vector maximization problem. In many cases, the unboundedness of this problem shows that no properly efficient solutions exist. Conditions are pointed out under which the latter conclusion implies that the set of efficient solutions is null. As a byproduct of our results, conditions are derived which guarantee that the outcome of any improperly efficient point is the limit of the outcomes of some sequence of properly efficient points. Examples are provided to illustrate these results.The author would like to thank Professor T. L. Morin for his helpful comments. Thanks also go to an anonymous reviewer for his useful comments concerning an earlier version of this paper.The author would like to acknowledge a useful discussion with Professor G. Bitran which helped in motivating Example 4.1.     

广义凸函数及非光滑多目标规划真有效解的充分条件

本文给出了一类广义凸函数的统一定义，在锥意义下，得出了非光滑多目标规划真有效解的充分条件，推广了以往的结论．     

Finding all maximal efficient faces in multiobjective linear programming

An algorithm for finding the whole efficient set of a multiobjective linear program is proposed. From the set of efficient edges incident to a vertex, a characterization of maximal efficient faces containing the vertex is given. By means of the lexicographic selection rule of Dantzig, Orden and Wolfe, a connectedness property of the set of dual optimal bases associated to a degenerate vertex is proved. An application of this to the problem of enumerating all the efficient edges incident to a degenerate vertex is proposed. Our method is illustrated with numerical examples and comparisons with Armand—Malivert's algorithm show that this new algorithm uses less computer time.     

Generating the weakly efficient set of nonconvex multiobjective problems

We present a method for generating the set of weakly efficient solutions of a nonconvex multiobjective optimization problem. The convergence of the method is proven and some numerical examples are encountered.