Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions
Description: This article discusses the construction of six generalized second-order parameter-free duality models, and proves several weak, strong, and strict converse duality theorems for a discrete minmax fractional programming problem using two partitioning schemes and various types of generalized second-order (ℱ, β, ɸ, 𝜌, θ, 𝑚)-univexity assumptions.
Date: November 8, 2016
Creator: Zalmai, G. J. & Verma, Ram U.
Item Type: Refine your search to only Article
Partner: UNT College of Arts and Sciences