solving binary semidefinite programming problems and binary linear programming problems via multi-objective programming

In recent years the binary quadratic program has grown in combinatorial optimization. quadratic programming can be formulated as a semidefinite programming problem. in this paper, we consider the general form of binary semidefinite programming problems (bsdp). we show the optimal solutions of the bsdp belong to the efficient set of a semidefinite multiobjective programming problem (sdmop). although finding all efficient points for multiobjective is not an easy problem, but solving a continuous problem would be easier than a discrete variable problem. in this paper, we solve an sdmop, as an auxiliary, instead of bsdp. we show the performance of our method by generating and solving random problems.