Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,P,d)-Convexity

Abdullah M. Al-roqi

doi:10.12785/amis/010120

ScienceGate Book Chapters

JOURNAL ARTICLE

Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,P,d)-Convexity

Abdullah M. Al-roqi

Year: 2014 Journal: Applied Mathematics & Information Sciences Vol: 9 (1)Pages: 155-160

DOI: 10.12785/amis/010120

Get Full-Text PDF Get Analytical Report

Keywords:

Minimax Convexity Duality (order theory) Fractional programming Mathematics Strong duality Applied mathematics Mathematical optimization Pure mathematics Optimization problem Nonlinear programming Physics Economics Nonlinear system

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.54

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,P,d)-Convexity

Metrics

Topics

Related Documents

Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,P,d)-Convexity

Duality theory in minimax multiobjective fractional programming under generalized (f, α, ρ, d)-convexity

Minimax fractional programming problem involving nonsmooth generalized ?-univex functions

Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity

Optimality conditions and duality for minimax fractional programming involving nonsmooth generalized univexity