GDL

Journal from gdlhub / 2019-05-10 09:43:22
Oleh : Y. Dasril, Zahriladha Zakaria, I. B. Mohd, Telkomnika
Dibuat : 2019-05-10, dengan 1 file

Keyword : fuzzy set, triangular fuzzy number, feasible set, quadratic programming, alpha-cuts, positivedefinite
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/11584
Sumber pengambilan dokumen : WEB

In this paper, we propose a computational procedure to find the optimal solution of quadratic programming problems by using fuzzyalpha-cuts and constraint exploration approach. We solve the problems in the original form without using any additional information such as Lagrange’s multiplier, slack, surplus and artificial variable. In order to find the optimal solution, we divide the calculation in two stages. In the first stage, we determine the unconstrained minimization of the quadratic programming problem (QPP) and check its feasibility. By unconstrained minimization we identify the violated constraints and focus our searching in these constraints. In the second stage, we explored the feasible region along side the violated constraintsuntil the optimal point is achieved. A numerical example is included in this paper to illustrate the capability of alpha-cuts and constraint exploration to find the optimal solution of QPP.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	Telkomnika
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com