Second- and higher-order generalised invexity and duality in mathematical programming
Summary: We have introduced the second- and higher-order generalised invex functions and applied it to mathematical programming problems. Also, we have established many duality relations (weak, strong and converse duality) between the non-linear primal problem and their corresponding second- and higher-order dual problems. By taking different examples, we have shown, that second-order duality gives tighter bound than first-order duality. It has also been observed that the higher-order duality gives tighter bound than first- and second-order duality.
second- and higher-order duality results
scientific article; zbMATH DE number 6876013