Setiawan , Leo Adi (2003) Program kuadratik dengan algoritma pivoting komplementar. Undergraduate thesis, FMIPA UNDIP.
PDF Restricted to Repository staff only 1933Kb | ||
| PDF 15Kb | |
| PDF 219Kb | |
| PDF 301Kb | |
| PDF 264Kb | |
| PDF 622Kb | |
PDF Restricted to Repository staff only 1022Kb | ||
| PDF 218Kb | |
| PDF 209Kb |
Abstract
Pemrograman kuadratik merupakan bagian dari pemrograman non-linier, dengan fungsi obyektifnya adalah fungsi kuadratik dan kendalanya fungsi linier. Permasalahan program kuadratik adalah menentukan solusi optimal dengan Fungsi Lagrange dan kondisi Optimalitas Kuhn Tucker merupakan metode penyelesaian dasar. Untuk penyelesaian dan penentuan titik optimal diterapkan teknik persoalan komplementer linier. Dan mencari solusi optimal dari persoalan komplementer linier menggunakan algoritma pivoting komplementer. Quadratic programing is a part of non linear programing where the objective is a quadratic function and boundaries problems are linear. Quadratic programing problems determined the optimal solutions using lagrangian function and Kuhn Tucker optimality conditions for the basic solution. And finding the optimal points using linear complementary technique. The optimal solution from linear complementary problem is determined using pivoting complementary algorithm
Item Type: | Thesis (Undergraduate) |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
ID Code: | 31576 |
Deposited By: | Mr UPT Perpus 1 |
Deposited On: | 23 Nov 2011 09:37 |
Last Modified: | 23 Nov 2011 09:37 |
Repository Staff Only: item control page