2013•International Journal of Mathematics in Operational ResearchRequires access

Second- and higher-order generalised invexity and duality in mathematical programming

Saroj Kumar Padhan, C. Nahak

Abstract

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Duality (order theory), Weak duality, Strong duality, Duality gap, Converse, Perturbation function, Wolfe duality, Mathematics