OPTIMALITY AND DUALITY FOR NONDIFFERENTIABLE FRACTIONAL PROGRAMMING WITH GENERALIZED INVEXITY

Abstract

We establish necessary and sufficient optimality conditions for a class of generalized nondifferentiable fractional optimization programming problems. Moreover, we prove the weak and strong duality theorems under (V, ρ)-invexity assumption.

This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.