Zhuang Yunbiao
Abstract
This paper gives one mixed type dual problem for a class of nondifferentiable generalized fractional programmingproblems, and proves weak duality, strong duality, and strict converse duality theorems under the assumptions of generalized(F,ρ) -convexity. The results improve and generalize those in [4].
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper gives one mixed type dual problem for a class of nondifferentiable generalized fractional programmingproblems, and proves weak duality, strong duality, and strict converse duality theorems under the assumptions of generalized(F,ρ) -convexity. The results improve and generalize those in [4].
Key concepts: Duality (order theory), Converse, Mathematics, Strong duality, Convexity, Class (philosophy), Wolfe duality, Weak duality