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

Bibliographic Details
Main Authors: Mohd, Ismail, Dasril, Yosza
Format: Article
Language:English
Published: 2000
Online Access:http://psasir.upm.edu.my/id/eprint/114091/
http://psasir.upm.edu.my/id/eprint/114091/1/114091.pdf
_version_ 1848866402252881920
author Mohd, Ismail
Dasril, Yosza
author_facet Mohd, Ismail
Dasril, Yosza
author_sort Mohd, Ismail
building UPM Institutional Repository
collection Online Access
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.
first_indexed 2025-11-15T14:20:02Z
format Article
id upm-114091
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T14:20:02Z
publishDate 2000
recordtype eprints
repository_type Digital Repository
spelling upm-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
spellingShingle Mohd, Ismail
Dasril, Yosza
Constraint exploration method for quadratic programming problem
title 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_short Constraint exploration method for quadratic programming problem
title_sort constraint exploration method for quadratic programming problem
url http://psasir.upm.edu.my/id/eprint/114091/
http://psasir.upm.edu.my/id/eprint/114091/
http://psasir.upm.edu.my/id/eprint/114091/
http://psasir.upm.edu.my/id/eprint/114091/1/114091.pdf