Metode Branch and Cut untuk Menyelesaikan Multi-Objective Integer Programming

Abstract

BRANCH AND CUT METHOD FOR SOLVING MULTI OBJECTIVE INTEGER PROGRAMMING ABSTRACT Branch and Cut method is a kind of technique for solving linear programming problem which expect integer for its decision variable, but it usually use to solve a single objective integer programming form. In this paper, the author will show how Branch and Cut method can solve a multi-objective integer programming or so-called goal programming. The author also used LINDO (Linear Discrete Optimization). Keywords: Branch and Cut, Multi-Objective Integer Programming, goal programming.