A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
MetadataShow full item record
We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions.
The original publication is available at: http://www.springerlink.com
Showing items related by title, author, creator and subject.
Uppu, S.; Krishna, Aneesh (2016)Revealing the underlying complex architecture of human diseases has received considerable attention since the exploration of genotype-phenotype relationships in genetic epidemiology. Identification of these relationships ...
Chan, Kit Yan; Kwong, C.; Wong, T. (2009)Product development involves several processes in which product planning is the first one. Several tasksnormally are required to be conducted in the product-planning process and one of them is to determinesettings of ...
Longitudinal analysis of cognitive constructs fostered by STEM activities for middle school studentsChristensen, R.; Knezek, G.; Tyler-Wood, T.; Gibson, David (2014)The purpose of this study was to determine whether the changes found to occur pre- to post intervention in students' cognitive structures continued to persist two years later. Major findings were: 1) higher-order STEM-related ...