Title of article
Computable error bounds for an optimization problem with parallelepiped constraint
Author/Authors
Mohd، نويسنده , , Ismail Bin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
10
From page
183
To page
192
Abstract
It can be shown that interval arithmetic can be used to locate the Kuhn-Tucker point of a nonlinear programming problem where its constraint is a parallelepiped with sides parallel to the coordinate axes.
Keywords
interval arithmetic , Kuhn-Tucker point , Transformation , Parallelepiped constraint
Journal title
Journal of Computational and Applied Mathematics
Serial Year
1995
Journal title
Journal of Computational and Applied Mathematics
Record number
1545905
Link To Document