Third order duality in nonlinear programming problems (Q523566)

The authors study nonlinear programming problems involving inequality type constraints and introduce the notion of third-order duality for them. They also give an example, which shows that the first- and second-order duals of a nonlinear programming problem may be failed whereas its third-order dual gives a solution. Weak, strong and converse duality theorems are established for the pair of primal and corresponding third-order dual problems.