Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming Problem

Y. Dasril, Zahriladha Zakaria, I. B. Mohd

Abstract


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.

Keywords


fuzzy set; triangular fuzzy number; feasible set; quadratic programming; alpha-cuts; positivedefinite;

Full Text:

PDF


DOI: http://dx.doi.org/10.12928/telkomnika.v16i6.11584

Article Metrics

Abstract view : 47 times
PDF - 85 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Universitas Ahmad Dahlan

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

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604

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

View TELKOMNIKA Stats