Program linier inter "Over Cones"

Abstract

Program Linear Integer "Over Cones" merupakan suatu metode yang, digunakan untuk memperoleh solusi optimal dalam Program Linear yang membatasi selunth variabel keputusannya pada nilai integer. Pembatas pada Program Linear Integer "Over Cones" , yaitu : B xE b — NxN , xB integer. direduksi menjadi : Ay = R ( b NxN ) , y integer. Grup Knapsack adalah persoalan grup dengan pembatas tunggal dan diperoleh dari bentuk ekuivalen pembatas Program Linear Integer "Over Cones" dimana - penyelesaiannya dilakukan secara Integer Linear Programming "Over Cones", known as a method that used to get an optimal solution of Linear Programming in which all the variable are restricted in integer value. Consider the constraints of Integer Linear Programming "Over Cones", B xi3 = b NxN xB integer It is reduced into, Ay = R ( b NxN ) , y integer. Group Knapsack is a group representation, which only has one constraint and formulated by equivalent representation of Integer Linear Programming "Over Cones" . Group Knapsack is solved by recursive equation. rekursif This document is Undip Institutional Repository Collection. The author(s) or-Wright owner(s) agree that UNDIP-IR may, without changing the content, translate the submission to any medium or format for the purpose of preservation. The author(s) or copyright owner(s) also agree that UNDIP-IR may keep more than one copy of this submission for purpose of security, back-up and preservation: http://eprints.undip.acid )