ILHAM, ILHAM (2008) PENYELESAIAN MASALAH PROGRAM LINIER DENGAN MENGGUNAKAN METODE DEKOMPOSISI LOKAL UNTUK SISTEM DUAL BLOCKANGULAR. Other thesis, University of Muhammadiyah Malang.

Text
PENYELESAIAN_MASALAH_PROGRAM_LINIER_DENGAN_MENGGUNAKAN_METODE_DEKOMPOSISI_LOKAL_UNTUK_SISTEM_DUAL_BLOCK.pdf Download (80kB)  Preview 
Abstract
Dual BlockAngular represent special form from linear program. Problem told by the in form of dual blockangular if owning a number of common definition, that is definition loading all variable which emerge in its free definition and problem. Linear programming generally cannot be altered into form of dual blockangular because do not own its free definition. Problem of linear programming which is the in form of dual blockangular can be finished by decomposition become main problem and sub of free problem. Solving of second of this problem can be done simultan. solution of Bases which got in problem applicable to new of solution bases of other problem. This matter is found by solution of bases giving optimal solution for problem of linear programming from the beginning. method of this decomposition is referred " local" because solving of problem is localizedly problem of linear program from the beginning in main problem and sub of free problem. Problem of linear programming which is the in form of dual block angular also can be finished a assistive program of computer by using program of Quantatif systems ( QS), giving same optimal solution
Item Type:  Thesis (Other) 

Subjects:  L Education > L Education (General) 
Divisions:  Faculty of Teacher Training and Education > Department of Mathematics and Computing 
Depositing User:  Anggit Aldila 
Date Deposited:  08 May 2012 04:19 
Last Modified:  08 May 2012 04:19 
URI:  http://eprints.umm.ac.id/id/eprint/4678 
Actions (login required)
View Item 