TY - JOUR
ID - 5490
TI - Solving binary semidefinite programming problems and binary linear programming problems via multi-objective programming
JO - International Journal of Nonlinear Analysis and Applications
JA - IJNAA
LA - en
SN -
AU - Safi, Mohammadreza
AU - Nabavi, Seyyed Saeed
AD - Faculty of Mathematics, Statistics and Computer Science, Semnan University, Semnan, Iran
Y1 - 2022
PY - 2022
VL - 13
IS - 1
SP - 297
EP - 304
KW - Semidenite programming
KW - Positive semidenite matrix
KW - Multiobjective programming
KW - Binary programming
DO - 10.22075/ijnaa.2019.13899.1724
N2 - 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, butsolving 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.
UR - https://ijnaa.semnan.ac.ir/article_5490.html
L1 - https://ijnaa.semnan.ac.ir/article_5490_98f5ff3feab0998ee2fa7bb7d0334cd0.pdf
ER -