scholarly journals A Full-Newton Step Interior Point Method for Fractional Programming Problem Involving Second Order Cone Constraint

Author(s):  
Mansour Saraj ◽  
Ali Sadeghi ◽  
Nezam Mahdavi Amiri

Some efficient interior-point methods (IPMs) are based on using a self-concordant barrier function related to the feasibility set of the underlying problem.Here, we use IPMs for solving fractional programming problems involving second order cone constraints. We propose a logarithmic barrier function to show the self concordant property and present an algorithm to compute $\varepsilon-$solution of a fractional programming problem. Finally, we provide a numerical example to illustrate the approach.

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Izhar Ahmad

We focus our study on a discussion of duality relationships of a minimax fractional programming problem with its two types of second-order dual models under the second-order generalized convexity type assumptions. Results obtained in this paper naturally unify and extend some previously known results on minimax fractional programming in the literature.


2019 ◽  
Vol 26 (3) ◽  
pp. 393-404 ◽  
Author(s):  
Ramu Dubey ◽  
S. K. Gupta

Abstract The purpose of this paper is to study a nondifferentiable multiobjective fractional programming problem (MFP) in which each component of objective functions contains the support function of a compact convex set. For a differentiable function, we introduce the class of second-order {(C,\alpha,\rho,d)-V} -type-I convex functions. Further, Mond–Weir- and Wolfe-type duals are formulated for this problem and appropriate duality results are proved under the aforesaid assumptions.


Sign in / Sign up

Export Citation Format

Share Document