Cover Image

Constraint exploration method for quadratic programming problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohd, Ismail, Dasril, Yosza
Format: Article
Language:English
Published: 2000
Online Access:http://psasir.upm.edu.my/id/eprint/114091/1/114091.pdf
http://psasir.upm.edu.my/id/eprint/114091/
https://linkinghub.elsevier.com/retrieve/pii/S0096300399000375
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.114091
record_format eprints
spelling my.upm.eprints.1140912024-12-10T01:43:13Z http://psasir.upm.edu.my/id/eprint/114091/ Constraint exploration method for quadratic programming problem Mohd, Ismail Dasril, Yosza 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. 2000 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/114091/1/114091.pdf 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 https://linkinghub.elsevier.com/retrieve/pii/S0096300399000375 10.1016/s0096-3003(99)00037-5
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description 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.
format Article
author Mohd, Ismail
Dasril, Yosza
spellingShingle Mohd, Ismail
Dasril, Yosza
Constraint exploration method for quadratic programming problem
author_facet Mohd, Ismail
Dasril, Yosza
author_sort Mohd, Ismail
title Constraint exploration method for quadratic programming problem
title_short Constraint exploration method for quadratic programming problem
title_full Constraint exploration method for quadratic programming problem
title_fullStr Constraint exploration method for quadratic programming problem
title_full_unstemmed Constraint exploration method for quadratic programming problem
title_sort constraint exploration method for quadratic programming problem
publishDate 2000
url http://psasir.upm.edu.my/id/eprint/114091/1/114091.pdf
http://psasir.upm.edu.my/id/eprint/114091/
https://linkinghub.elsevier.com/retrieve/pii/S0096300399000375
_version_ 1818835917490618368
score 13.244413

Similar Items