Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity
<p>Abstract</p> <p>In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2011-01-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://www.journalofinequalitiesandapplications.com/content/2011/1/75 |
| _version_ | 1828229871750348800 |
|---|---|
| author | Kailey N Gupta SK Ahmad Izhar Agarwal Ravi |
| author_facet | Kailey N Gupta SK Ahmad Izhar Agarwal Ravi |
| author_sort | Kailey N |
| collection | DOAJ |
| description | <p>Abstract</p> <p>In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under <it>B</it>-(<it>p</it>, <it>r</it>)-invexity assumptions. Examples are given to show that <it>B</it>-(<it>p</it>, <it>r</it>)-invex functions are generalization of (<it>p</it>, <it>r</it>)-invex and convex functions</p> <p> <b>AMS Subject Classification: </b>90C32; 90C46; 49J35.</p> |
| first_indexed | 2024-04-12T18:39:40Z |
| format | Article |
| id | doaj.art-68472f98e0934f358afd2b8bc5f22f86 |
| institution | Directory Open Access Journal |
| issn | 1025-5834 1029-242X |
| language | English |
| last_indexed | 2024-04-12T18:39:40Z |
| publishDate | 2011-01-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Journal of Inequalities and Applications |
| spelling | doaj.art-68472f98e0934f358afd2b8bc5f22f862022-12-22T03:20:50ZengSpringerOpenJournal of Inequalities and Applications1025-58341029-242X2011-01-012011175Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexityKailey NGupta SKAhmad IzharAgarwal Ravi<p>Abstract</p> <p>In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under <it>B</it>-(<it>p</it>, <it>r</it>)-invexity assumptions. Examples are given to show that <it>B</it>-(<it>p</it>, <it>r</it>)-invex functions are generalization of (<it>p</it>, <it>r</it>)-invex and convex functions</p> <p> <b>AMS Subject Classification: </b>90C32; 90C46; 49J35.</p>http://www.journalofinequalitiesandapplications.com/content/2011/1/75nondifferentiable fractional programmingoptimality conditions<it>B</it>-(<it>p</it>, <it>r</it>)-invex functionduality theorems |
| spellingShingle | Kailey N Gupta SK Ahmad Izhar Agarwal Ravi Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity Journal of Inequalities and Applications nondifferentiable fractional programming optimality conditions <it>B</it>-(<it>p</it>, <it>r</it>)-invex function duality theorems |
| title | Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity |
| title_full | Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity |
| title_fullStr | Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity |
| title_full_unstemmed | Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity |
| title_short | Duality in nondifferentiable minimax fractional programming with <it>B</it>-(<it>p</it>, <it>r</it>)<b>-</b>invexity |
| title_sort | duality in nondifferentiable minimax fractional programming with it b it it p it it r it b b invexity |
| topic | nondifferentiable fractional programming optimality conditions <it>B</it>-(<it>p</it>, <it>r</it>)-invex function duality theorems |
| url | http://www.journalofinequalitiesandapplications.com/content/2011/1/75 |
| work_keys_str_mv | AT kaileyn dualityinnondifferentiableminimaxfractionalprogrammingwithitbititpititritbbinvexity AT guptask dualityinnondifferentiableminimaxfractionalprogrammingwithitbititpititritbbinvexity AT ahmadizhar dualityinnondifferentiableminimaxfractionalprogrammingwithitbititpititritbbinvexity AT agarwalravi dualityinnondifferentiableminimaxfractionalprogrammingwithitbititpititritbbinvexity |