Generalized Second-Order Duality for a Continuous Programming Problem with Support Functions
A generalized second-order dual is formulated for a continuous programming problem in which support functions appear in both objective and constraint functions, hence it is nondifferentiable. Under second-order pseudoinvexity and second-order quasi-invexity, various duality theorems are proved for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous programming problems with natural boundary values is constructed and it is pointed out that the duality results for the pair can be validated analogously to those of the dual models with fixed end points. Finally, a close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly mentioned.
Generalized second-order dual; Continuous programming; Second-order pseudoinvexity; Second-order quasi-invexity
- There are currently no refbacks.
If you have already registered in Journal A and plan to submit article(s) to Journal B, please click the CATEGORIES, or JOURNALS A-Z on the right side of the "HOME".
We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
firstname.lastname@example.org; email@example.com; firstname.lastname@example.org
Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures
Address: 730, 77e AV, Laval, Quebec, H7V 4A8, Canada
Telephone: 1-514-558 6138