We transform it into the general parameter linear programming problem by means of the concept λ cut of a set,prove that the method is the extension of the method for the interval number linear programming with the concept of constraint satisfactory degree, and provide an efficient and satisfactory way for uncertainty linear programming problem.

Axiomatic description of cut sets of μ-Fuzzy set;

By using the relation between cut sets,it is proved that,under reflexive condition,the maximum fuzzy set contains the greatest fuzzy set,and that,under both reflexive and complete conditions,the two sets are equal to each other.

Based on the cut set and representation theorem of fuzzy set,the approximation operator,the strong approximation operator and the weak approximation operator of rough fuzzy set are constructed in a new way,and two new descriptions of rough fuzzy set is obtained.

A flow network is established from activity and the algorithm forthe time-cost optimization in the latter network is provided by finding out theminimum-cut and opposite cut in the former network.

This paper gives out a negative answer to the question that a circuit (cut) set can be represented by combinations of a set of disconnected cycle (cut) with coeffient in Z

The concept of faith degree of grey information and its calculating formulas were given when the concept of cut sets in the obverse and the reverse of grey information was presented.

Then it gives an approach to build covering fuzzy rough sets,which is based on the cut sets of fuzzy sets.