Citation
Mohd, Ismail and Dasril, Yosza
(2000)
Constraint exploration method for quadratic programming problem.
Applied Mathematics and Computation, 112 (2-3).
pp. 161-170.
ISSN 0096-3003; eISSN: 0096-3003
Abstract
In this paper, we represent a method which is based on the violated constraints by the unconstrained minimum of the objective function of the quadratic programming problem for exploring, locating and computing the optimal solution of the problem without using additional information as have been done in most of the favourite established methods.
Download File
Official URL or Download Paper: https://linkinghub.elsevier.com/retrieve/pii/S0096...
|
![[img]](http://psasir.upm.edu.my/style/images/fileicons/text.png)
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science |
| DOI Number: | https://doi.org/10.1016/s0096-3003(99)00037-5 |
| Keywords: | Constrained minimization; Constraint exploration method; Quadratic programming |
| Depositing User: | Ms. Azian Edawati Zakaria |
| Date Deposited: | 10 Dec 2024 01:43 |
| Last Modified: | 10 Dec 2024 01:43 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/s0096-3003(99)00037-5 |
| URI: | http://psasir.upm.edu.my/id/eprint/114091 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |