scholarly journals Robust optimality and duality for minimax fractional programming problems with support functions

2021 ◽  
Vol 2021 (1) ◽  
Keyword(s):  
Fractional Programming ◽  
Support Functions ◽  
Minimax Fractional Programming ◽  
Optimality And Duality

scholarly journals Optimality and Duality for Nondifferentiable Minimax Fractional Programming with Generalized Convexity

2011 ◽  
Vol 2011 ◽  
pp. 1-19 ◽  
Author(s):  
Anurag Jayswal
Keyword(s):  
Fractional Programming ◽  
Generalized Convexity ◽  
Optimality Criteria ◽  
Sufficient Optimality Conditions ◽  
View Point ◽  
Generalized Convex Functions ◽  
Duality Results ◽  
Minimax Fractional Programming ◽  
Optimality And Duality ◽  
Dual Models

We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity. Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions. Our results extend and unify some known results on minimax fractional programming problems.

scholarly journals Optimality and duality for a class of nondifferentiable minimax fractional programming problems

2009 ◽  
Vol 19 (1) ◽  
pp. 49-61
Author(s):  
Antoan Bătătorescu ◽  
Miruna Beldiman ◽  
Iulian Antonescu ◽  
Roxana Ciumara
Keyword(s):  
Optimality Conditions ◽  
Fractional Programming ◽  
Dual Problem ◽  
Sufficient Optimality Conditions ◽  
Square Root ◽  
Duality Results ◽  
Minimax Fractional Programming ◽  
Optimality And Duality ◽  
Necessary And Sufficient

Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we prove some duality results.

Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity

Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2557-2574 ◽  
Author(s):  
Tadeusz Antczak
Keyword(s):  
Saddle Point ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Equality Constraints ◽  
New Class ◽  
Minimax Fractional Programming

Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric saddle point conditions are established for a new class of nonconvex differentiable semi-infinite minimax fractional programming problems under(?,?)-invexity assumptions. With the reference to the said concept of generalized convexity, we extend some results of saddle point criteria for a larger class of nonconvex semi-infinite minimax fractional programming problems in comparison to those ones previously established in the literature.

scholarly journals Optimality and Duality for Complex Nondifferentiable Fractional Programming

1997 ◽  
Vol 210 (2) ◽  
pp. 804-824 ◽  
Author(s):  
Jen-Chwan Liu ◽  
Chin-Cheng Lin ◽  
Ruey-Lin Sheu
Keyword(s):  
Fractional Programming ◽  
Optimality And Duality

scholarly journals Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions

2020 ◽  
Vol 11 ◽  
pp. 17
Author(s):  
Tarek Emam
Keyword(s):  
Strong Duality ◽  
Sufficient Optimality Conditions ◽  
Convex Programming Problem ◽  
Duality Theorems ◽  
Support Functions ◽  
Primal Problem ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Optimality And Duality ◽  
Convexity Assumptions

In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak and strong duality theorems under various generalized E-convexity assumptions.

Sign in / Sign up

Export Citation Format

Share Document