A quadratic optimization problem with bipolar fuzzy relation equation constraints

This paper studies the quadratic programming problem subject to asystem of bipolar fuzzy relation equations with the max-productcomposition. A characterization of structure of its feasible domain is presented using the lower and upper bound vector on its solution set. A sufficient condition is proposed which under the condition, a component of one of its optimal solutions is the corresponding component of either the lower or upper bound vector. Some sufficient conditions are suggested to reveal one of its optimal solutions without resolution of the problem. Furthermore, some sufficient conditions are then given to determine some components from one of its optimal solutions. Based on these conditions, we can simplify the problem and reduce its dimensions. The simplified problem can be reformulated to an 0-1 mixed integer programming problem. Other unknown variables can be found by solving the current problem.