Higher-order (F,alpha,beta,rho,d)-Convexity and its Application in Fractional Programming

Authors

  • T. R. Gulati Indian Institite of Technology Roorkee, Roorkee India
  • Himani Saini Indian Institite of Technology Roorkee, Roorkee India

Keywords:

Higher-order $(F, \alpha, \beta, \rho, d)$-convexity, Sufficiency, Optimality conditions, Duality, Fractional programming.

Abstract

In this paper we introduce the concept ofhigher-order $(F,\alpha,\beta,\rho,d)$-convexity with respect to adifferentiable function $K$. Based on this generalized convexity,sufficient optimality conditions for a nonlinear programming problem(NP) are obtained. Duality relations for Mond-Weir and Wolfe dualsof (NP) have also been discussed. These duality results are then applied to nonlinear fractional programming problems.

Author Biographies

  • T. R. Gulati, Indian Institite of Technology Roorkee, Roorkee India

    Professor

    Department of Mathematics

    Indian Institute of Technology Roorkee 

  • Himani Saini, Indian Institite of Technology Roorkee, Roorkee India

    Ph D Student

    Department of Mathematics

    Indian Institute of Technology Roorkee 

Downloads

Published

2011-08-09

Issue

Section

Operational Research

How to Cite

Higher-order (F,alpha,beta,rho,d)-Convexity and its Application in Fractional Programming. (2011). European Journal of Pure and Applied Mathematics, 4(3), 266-275. https://www.ejpam.com/index.php/ejpam/article/view/619