Skip to main content
×
Home
    • Aa
    • Aa

Duality for fractional minimax programming problems

  • Shri Ram Yadav (a1) and R. N. Mukherjee (a1)
Abstract
Abstract

Duality theory is discussed for fractional minimax programming problems. Two dual problems are proposed for the minimax fractional problem: minimize maxy∈Υf(x, y)/h(x, y), subject to g(x) ≤ 0. For each dual problem a duality theorm is established. Mainly these are generalisations of the results of Tanimoto [14] for minimax fractional programming problems. It is noteworthy here that these problems are intimately related to a class of nondifferentiable fractional programming problems.

    • Send article to Kindle

      To send this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Duality for fractional minimax programming problems
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Duality for fractional minimax programming problems
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Duality for fractional minimax programming problems
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] B. D. Craven , Mathematical Programming and Control Theory (Chapman and Hall, London, 1978).

[3] R. J. Duffin , “Numerical estimation of optima by use of dual inequalities”, in Semi-infinite programming and applications (eds. A. V. Fiacco and K. O. Kortanek ), (Springer-Verlag, Berlin, 1983) 118127.

[7] B. Mond , “A class of nondifferentiable mathematical programming problems, J. of Math. Anal. and Appl. 46 (1974) 169174.

[9] R. Rockafellar , Convex analysis (Princeton University, press, Princeton, New Jersey, 1970).

[11] M. Schechter , “A subgradient duality theorem”, J. of Math. Anal. and Appl. 61 (1977) 850855.

[12] W. E. Schmitendorf , “Necessary conditions and sufficient conditions for static minimax problems”, J. of Math. Anal. and Appl. 57 (1977) 683”693.

[13] C. Singh , “Optimality conditions for fractional minimax programming, J. of Math. Anal. and Appl. 100 (1984) 409415.

[14] S. Tanimoto , “Duality for a class of nondifferentiable mathematical programming problems”, J. of Math. Anal. and Appl. 79 (1981) 283294.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The ANZIAM Journal
  • ISSN: 1446-1811
  • EISSN: 1446-8735
  • URL: /core/journals/anziam-journal
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax