Multiple Objective Fractional Subset Programming Based on Generalized $(\rho, \eta, A)$-Invex Functions

Authors

  • Ram U. Verma Texas A&M University -- Kingsville, Department of Mathematics, Kingsville, Texas 78363, USA

DOI:

https://doi.org/10.26713/jims.v3i1.43

Keywords:

Generalized $(\rho, \eta, A)$-invexity, Multiple objective fractional subset programming, Efficient solution, Generalized invexity, Semi-parametric sufficient optimality conditions

Abstract

Motivated by the recent investigations [7,8,10,11,12], a general framework for a class of $(\rho, \eta, A)$-invex n-set functions is introduced, and then some results on the optimality conditions for multiple objective fractional subset programming on the generalized $(\rho, \eta, A)$-invexity are explored. The obtained results are general in nature and seem to be application-oriented to other results on fractional subset programming in literature.

Downloads

Downloads

CITATION

How to Cite

Verma, R. U. (2011). Multiple Objective Fractional Subset Programming Based on Generalized $(\rho, \eta, A)$-Invex Functions. Journal of Informatics and Mathematical Sciences, 3(1), 79–86. https://doi.org/10.26713/jims.v3i1.43

Issue

Vol. 3 No. 1 (2011)

Section

Research Article

License

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.