An Alternative Method on Quadratic Programming Problems

被引：0
|
作者：
Dasril, Y. [1 ]
Mohd, I. B. [3 ]
Mustaffa, I. [2 ]
Aminuddin, M. M. M. [1 ]
机构：
[1] Univ Tekn Malaysia Melaka, Fac Elect & Comp Engn, Durian Tunggal 76100, Melaka, Malaysia
[2] Univ Tekn Malaysia Melaka, Fac Technol Engn, Melaka, Malaysia
[3] Univ Malaysia Terengganu, Fac Sci & Technol, Terengganu 21030, Kuala Terenggan, Malaysia
来源：
INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2014 (ICOMEIA 2014) | 2015年 / 1660卷
关键词：
optimum solution; quadratic; programming; feasible; exploration;
D O I：
10.1063/1.4915805
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we proposed an alternative approach to find the optimum solution of quadratic programming problems (QPP) in its original form without additional information such as slack variable, surplus variable or artificial variable as done in other favourite methods. This approached is based on the violated constraints by the unconstrained optimum. The optimal solution of QPP obtained by searching from initial point to another point alongside of feasible region.
引用
收藏
页数：5
相关论文
共 50 条
12345