Pemecahan Masalah Integer Programming Biner Dengan Metode Penambahan

Authors

  • Wawan Laksito YS

DOI:

https://doi.org/10.30646/sinus.v4i2.295

Abstract

Program Linier adalah perencanaan aktifitas-aktifitas untuk memperoleh suatu hasil yang optimal. Tidak semua variabel keputusan dalam Program Linier dapat berupa bilangan pecahan, Beberapa variabel Integer Programming dapat dinyatakan dalam bentuk nol-satu (biner). Penyelesaian masalah Integer Programing dimulai dengan menyelesaikan masalah Program Linier dengan metoda dual dan dilanjutkan dengan Metoda Penambahan dengan Perhitungan  Implisit  Nol-Satu (Biner)

Downloads

Published

2017-05-03

How to Cite

Laksito YS, W. (2017). Pemecahan Masalah Integer Programming Biner Dengan Metode Penambahan. Jurnal Ilmiah SINUS, 4(2). https://doi.org/10.30646/sinus.v4i2.295

Issue

Vol. 4 No. 2 (2006): Juli 2006

Section

Articles

License

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

 

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.