Prediction of efficient outputs based on GM(1,N) model and weak DEA efficiency

This paper expresses the efficient outputs of decisionmaking unit（DMU） as the sum of ＂average outputs＂ forecasted by a GM（1,N） model and ＂increased outputs＂ which reflect the difficulty to realize efficient outputs.The increased outputs are solved by linear programming using data envelopment analysis efficiency theories,wherein a new sample is introduced whose inputs are equal to the budget in the issue No.n ＋ 1 and outputs are forecasted by the GM（1,N） model.The shortcoming in the existing methods that the forecasted efficient outputs may be less than the possible actual outputs according to developing trends of input-output rate in the periods of pre-n is overcome.The new prediction method provides decision-makers with more decisionmaking information,and the initial conditions are easy to be given.

MAJOR－EFFICIENT SOLUTIONS AND WEAKLY MAJOR－EFFICIENT SOLUTIONS OF MULTIOBJECTIVE PROGRAMMING

In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.

EKELAND'S PRINCIPLE FOR SET-VALUED VECTOR EQUILIBRIUM PROBLEMS

In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland＇s theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.

NON-CONFLICTING ORDERING CONES AND VECTOR OPTIMIZATION IN INDUCTIVE LIMITS

Let （E,ξ）=ind（En,ξn） be an inductive limit of a sequence （En,ξn）n∈N of locally convex spaces and let every step （En,ξn） be endowed with a partial order by a pointed convex （solid） cone Sn. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence （Sn）n∈N of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.

ON MULTIOBJECTIVE FRACTIONAL PROGRAMS

In this paper some optimality criteria are proved and some Mond\|Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.

Existence of Weakly Efficient Solutions in Vector Optimization

In this paper, we present an existence result for weak efficient solution for the vector optimization problem. The result is stated for invex strongly compactly Lipschitz functions.

Optimality Conditions for Generalized Convex Nonsmooth Uncertain Multi-objective Fractional Programming

This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex function pairs,called type-I functions and pseudo-quasi-type-I functions,are introduced in this paper for(NUMFP).Under the assumption that(NUMFP)satisfies the robust constraint qualification with respect to Clarke subdifferential,necessary optimality conditions of the robust weak efficient solution are given.Sufficient optimality conditions are obtained under pseudo-quasi-type-I generalized convexity assumption.Furthermore,we introduce the concept of robust weak saddle points to(NUMFP),and prove two theorems about robust weak saddle points.The main results in the present paper are verified by concrete examples.

Fenchel-Lagrange Duality and Saddle-Points for Constrained Vector Optimization

The aim of this paper is to apply a perturbation approach to deal with Fenchel- Lagrange duality based on weak efficiency to a constrained vector optimization problem. Under the stability criterion, some relationships between the solutions of primal problem and the Fenchel-Lagrange duality are discussed. Moreover, under the same condition, two saddle-points theorems are proved.

On Relations of Vector Optimization Results with C^(1,1) Data

In this article we prove that some of the sufficient and necessary optimality conditions obtained by Ginchev, Guerraggio, Luc [Appl. Math., 51, 5-36 （2006）] generalize （strictly） those presented by Guerraggio, Luc [J. Optim. Theory Appl., 109, 615-629 （2001）]. While the former paper shows examples for which the conditions given there are effective but the ones from the latter paper fail, it does not prove that generally the conditions it proposes are stronger. In the present note we complete this comparison with the lacking proof.