STABILITY OF MAJORLY EFFICIENT POINTS AND SOLUTIONS IN MULTIOBJECTIVE PROGRAMMING

ＳＴＡＢＩＬＩＴＹＯＦＭＡＪＯＲＬＹＥＦＦＩＣＩＥＮＴＰＯＩＮＴＳＡＮＤＳＯＬＵＴＩＯＮＳＩＮＭＵＬＴＩＯＢＪＥＣＴＩＶＥＰＲＯＧＲＡＭＭＩＮＧＧＵＧＵＯＨＵＡＡＮＤＨＵＹＵＤＡ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓａｎｄＭｅｃｈａｎｉｃｓ...     

ON SOME PROPERTIES OF SOLUTIONS TO SEMIDEFINITE PROGRAMMING

It is well known that for symmetric linear programming there exists a strictly complementary solution if the primal and the dual problems are both feasible. However, this is not necessary true for symmetric or general semide finite programming even if both the primal problem and its dual problem are strictly feasible. Some other properties are also concerned.     

EXISTENCE OF GENERALIZED WEAKLY SOLUTIONS OF DIFFERENTIAL EQUATIONS IN PRODUCT SPACES

In this paper, by using Lyapunov function and weak noncompactness conditions, we give an existence theorem of generalized weakly solutions of Cauchy problem of differential equations in product spaces.     

CHARACTERIZATION OF EFFICIENT SOLUTIONS FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS INVOLVING SEMI-STRONG AND GENERALIZED SEMI-STRONG E-CONVEXITY

The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.     

THE EXISTENCE OF ALMOST PERIODIC SOLUTIONS AND PERIODIC SOLUTIONS

In this paper,it is obtained that a periodic system has an almost periodic solution ifit has a solution x=(t)uniformly stable with respect to Ω_,and has a periodic solutionif x=(t)is weakly uniformly asymptotically stable with respect to Ω_.Meanwhile,it isalso obtained that a uniformly almost periodic system has an almost periodic solution if ithas a solution x=(t)uniformly asymptotically stable with respect to A_~f     

ON THE CONSTRUCTION OF MAJOR AND MINOR FUNCTIONS

In this paper,we construct directly absolutely continuous major and minor functions of a function which is Lebesque integrable ,and we also construct directly continuous major and minor functions of a function which is Henstock-Kurzweil integrable.     

STABILITY AND EXISTENCE OF PERIODIC SOLUTIONS AND ALMOST PERIODIC SOLUTIONS ON LIENARD SYSTEMS

1MainResultsConsidersystem11~.x f(x)x' g(x)~0(1)wheref(x)islocallyintegrable,g(x)isdifferentiablealldg(0)=0.Theroem1Thezerosolutionofsystem(1)isuniformlyasymptoticallystableifbyequivalenttransf'Ormu=xov=X' F(x).DefineW[t,(uif\v)]j6ug(s)ds Iv',thenwisaposi…     

ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING＊

In this paper, we consider the solution of the standard linear programming [Lt＇）. A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real-world problems have infinitely many optimal solutions and pursuing the optimal face, not just an optimal vertex, is quite desirable. The face algorithm proposed by Pan [19] targets at the optimal face by iterating from face to face, along an orthogonal projection of the negative objective gradient onto a relevant null space. The algorithm exhibits a favorable numerical performance by comparing the simplex method. In this paper, we further investigate the face algorithm by proposing an improved implementation. In exact arithmetic computation, the new algorithm generates the same sequence as Pan＇s face algorithm, but uses less computational costs per iteration, and enjoys favorable properties for sparse problems.     

BOUNDED SOLUTIONS AND PERIODIC SOLUTIONS OF VISCOUS POLYTROPIC GAS EQUATIONS

ＢＯＵＮＤＥＤＳＯＬＵＴＩＯＮＳＡＮＤＰＥＲＩＯＤＩＣＳＯＬＵＴＩＯＮＳＯＦＶＩＳＣＯＵＳＰＯＬＹＴＲＯＰＩＣＧＡＳＥＱＵＡＴＩＯＮＳＬＵＯＴＡＯＡｂｓｔｒａｃｔＡｐｉｓｔｏｎｐｒｏｂｌｅｍｏｆｖｉｓｃｏｕｓｐｏｌｙｔｒｏｐｉｃｇａｓｅｑｕａｔｉｏ...     

EXISTENCE OF THE UNIFORMLY ULTIMATE BOUNDED SOLUTIONS AND PERIODIC SOLUTIONS

１ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒａｔｈｉｒｄｏｒｄｅｒｎｏｎｌｉｎｅａｒｃｏｎｔｒｏｌｓｙｓｔｅｍｉｎｔｈｅｆｏｒｍｘ…＋Ｆ（ｒ）ｘ¨＋Ｇ（ｒ）ｘ·＋Ｈ（ｒ）ｘ＝ｅ（ｔ），（１）ｗｈｅｒｅＦ（ｒ）＝１－ε［１＋ｋｎ（ε）ｒ２］，Ｇ（ｒ）＝１...     

Constructing efficient solutions structure of multiobjective linear programming

It is not a difficult task to find a weak Pareto or Pareto solution in a multiobjective linear programming (MOLP) problem. The difficulty lies in finding all these solutions and representing their structure. This paper develops an algorithm for solving this problem. We investigate the solutions and their relationships in the objective space. The algorithm determines finite number of weights, each of which corresponds to a weighted sum problems. By solving these problems, we further obtain all weak Pareto and Pareto solutions of the MOLP and their structure in the constraint space. The algorithm avoids the degeneration problem, which is a major hurdle of previous works, and presents an easy and clear solution structure.     

多目标规划强较多有效解和弱较多有效解的标量化和对偶性

利用n维Euclid空间中较多锥的闭包,定义了多目标规划强较多有效解.利用较多锥闭包的Minkowski泛函,给出了强较多有效解和弱较多有效解的标量化结果,并讨论了强较多有效解和弱较多有效解的标量对偶问题及其应用.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Solution approaches for the multiobjective stochastic programming

We survey in this paper various solution approaches for multiobjective stochastic problems where random variables can be in both objectives and constraints parameters. Once a problem requires a stochastic formulation, a first step consists in transforming the problem into its deterministic formulation. We propose to classify and evaluate such transformations with regards to the many proposed concepts of efficiency. The paper addresses also some applications of the multiobjective stochastic programming models.     

Weakly and properly nonessential objectives in multiobjective optimization problems

In this work we characterize objective functions which do not change the set of efficient solutions (weakly efficient solutions, properly efficient solutions). Necessary and sufficient conditions for an objective function to be weakly nonessential (properly nonessential) are presented. We establish relations between weakly nonessential, properly nonessential and nonessential functions.     

Nonsmooth multiobjective programming with quasi-Newton methods

This paper proposes a new algorithm to solve nonsmooth multiobjective programming. The algorithm is a descent direction method to obtain the critical point (a necessary condition for Pareto optimality). We analyze both global and local convergence results under some assumptions. Numerical tests are also given.     

Maximal and supremal tolerances in multiobjective linear programming

Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the computed intervals. The known methods either yield tolerances that are not the maximal possible ones, or they consider perturbations of weights of the weighted sum scalarization only. We focus directly on perturbations of the objective function coefficients, which makes the approach independent on a scalarization technique used. In this paper, we propose a method for calculating the supremal tolerance (the maximal one need not exist). The main disadvantage of the method is the exponential running time in the worst case. Nevertheless, we show that the problem of determining the maximal/supremal tolerance is NP-hard, so an efficient (polynomial time) procedure is not likely to exist. We illustrate our approach on examples and present an application in transportation problems. Since the maximal tolerance may be small, we extend the notion to individual lower and upper tolerances for each objective function coefficient. An algorithm for computing maximal individual tolerances is proposed.     

Piecewise equitable efficiency in multiobjective programming

In equitable multiobjective optimization all the objectives are uniformly optimized, but in some cases the decision maker believes that some of them should be uniformly optimized. To solve this problem in this paper, the original problem is decomposed into a collection of smaller subproblems, according to the decision maker, and then the subproblems are solved by the concept of equitable efficiency. Furthermore, by using the concept of P$P$-equitable efficiency two models are presented to coordinate equitably efficient solutions of subproblems.     

Duality theorem of nondifferentiable convex multiobjective programming

Necessary and sufficient conditions of Fritz John type for Pareto optimality of multiobjective programming problems are derived. This article suggests to establish a Wolfe-type duality theorem for nonlinear, nondifferentiable, convex multiobjective minimization problems. The vector Lagrangian and the generalized saddle point for Pareto optimality are studied. Some previously known results are shown to be special cases of the results described in this paper.This research was partly supported by the National Science Council, Taipei, ROC.The authors would like to thank the two referees for their valuable suggestions on the original draft.     

可能性与必要性测度性质及可能多目标线性规划的模糊有效解关系定理

在文 [1 ]基础上 ,深入研究了可能性与必要性测度的重要性质 ;通过反例指出在一般情形下 ( A,B至少有一个为严格模糊集合 )由“NA( B) >0”出发 ,得不出“πA( B) =1”的结论 ;同时 ,论证了上述结论成立的条件 ,以此为基础 ,得到两种测度的相关定理。这样 ,便纠正了文[1 ]中的错误。接下来研究了可能多目标规划问题中的两种解——必要有效解与可能有效解之间的关系 ,得到相应的关系定理。作为它的应用 ,我们给出三个实例