EQUIVALENT L-FUZZY OPTIMIZATION PROBLEMS

In this paper L is considered as a Boolean or CJ-lattice. Consider the optimization problem minfZ = C ¤ XjA ¤ X ¸ bg where A, b are fixed matrices, X is an unknown matrix and C is a given matrix of coefficients of objective function Z over L. We make an equivalent optimization problem which its coefficients are reduced, but all solutions of both problems are equal