Second order nondifferentiable minimax fractional programming with square root terms | Zendy

I. Ahmad | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Second order nondifferentiable minimax fractional programming with square root terms

Author(s) -

I. Ahmad

Publication year - 2013

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1301135a

Subject(s) - mathematics , minimax , converse , convexity , fractional programming , order (exchange) , duality (order theory) , square root , parametric statistics , dual (grammatical number) , extension (predicate logic) , mathematical optimization , combinatorics , nonlinear programming , statistics , nonlinear system , physics , geometry , finance , quantum mechanics , financial economics , economics , art , literature , computer science , programming language

In this paper, we study a nondifferentiable minimax fractional programming problem under the assumptions of generalized second order (F , α, ρ,d)−convexity. A second order parametric dual is formulated. Weak, strong and converse duality theorems are established in order to relate the primal and dual problems under the afore-said assumptions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research