Constraint exploration method for quadratic programming problem

Mohd, IB

doi:10.1016/S0096-3003(99)00037-5

2000-06-01

PRE

Mohd, IB *

Yosza Dasril

DOI：10.1016/S0096-3003(99)00037-5

原文链接

原文求助

摘要

En 中文

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. (C) 2000 Published by Elsevier Science Inc. All rights reserved.

Keyword:

constraint exploration method

quadratic programming

constrained minimization