Teknik Linierisasi untuk Persoalan Program Kuadratik Nol-Satu

Abstract

 Zero-one quadratic programming is a mathematical programming model in which the objective function and constraints has quadratic form, and decision variable are restricted to zero-one value. Zero-one quadratic programming model issues appeared in various aspects, such as economics, computing, applied science and engineering. This thesis proposes a linearization technique to resolve the issue of zero-one quadratic programming that was developed by Sherali-Smith. Techniques linearization change Quadratic Problems (QP) to issue Bilinear Problems (BP) in advance. End of this search resulted in transformation of zero one quadratic programming into a zero-one linear programming.