A sixth bibliography of fractional programming

Stancu-Minasian, I. M.

doi:10.1080/02331930600819613

Cited by 58 publications

(22 citation statements)

References 232 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The focus has since shifted to problems involving multiple ratios, where one, for example, seeks to maximize the sum of several ratios, or maximize the minimum value of several ratios. Other monographs on fractional programming are Craven [13] and Stancu-Minasian [51], see also [20,48,52].…”

Section: Single-ratio Fractional Programmingmentioning

confidence: 99%

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

Hansen

Meyer

2014

Clusters, Orders, and Trees: Methods and Applications

View full text Add to dashboard Cite

We derive conditions on the functions ', , v and w such that the 0-1 fractional programming problem max w.x/ on OE0I C1/. In particular we show that when ' is convex and increasing, is concave, increasing and strictly positive, v and w are supermodular and either v or w has a monotonicity property, then the 0-1 fractional programming problem can be solved in polynomial time in essentially the same time complexity than to solve the fractional programming problem max, and this even if ' and are nonrational functions provided that it is possible to compare efficiently the value of the objective function at two given points of f0I 1g n . We apply this result to show that a 0-1 fractional programming problem arising in additive clustering can be solved in polynomial time.

show abstract

Section: Single-ratio Fractional Programmingmentioning

confidence: 99%

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

Hansen

Meyer

2014

Clusters, Orders, and Trees: Methods and Applications

View full text Add to dashboard Cite

show abstract

“…Many economic, noneconomic and indirect applications of FP problems have also been given by Craven [1] and Schaible and Ibaraki [2]. An extensive review and bibliography of the entire field of FP can be seen in [3][4][5][6][7][8][9][10]. Among them, Busygin et al [3] applied an interesting application of FP in data analysis.…”

Section: Introductionmentioning

confidence: 97%

A practical nonlinear dynamic framework for solving a class of fractional programming problems

Nazemi

Tahmasbi

2015

Nonlinear Dyn

View full text Add to dashboard Cite

In this paper, we present a highperformance dynamic optimization scheme to solve a class of fractional programming (FP) problems. The main idea is to convert the FP problem into an equivalent convex second-order cone programming problem. A neural network model based on a dynamic model is then constructed for solving the obtained convex programming problem. By employing a credible Lyapunov function approach, it is shown that the proposed neural network model is stable in the sense of Lyapunov and is globally convergent to an exact optimal solution of the original optimization problem. A block diagram of the model is also given. Several illustrative examples are provided to show the efficiency of the proposed method in this manuscript.

show abstract

“…Duality in multiobjective fractional programming problems involving generalized convex functions have been of much interest in recent past, (see [4,5,8,14,16,18,22]) and the references cited therein. For more information about fractional programming problems, the reader may consult the research bibliography compiled by Stancu-Minasian [19,20,21].…”

Section: Introductionmentioning

confidence: 99%

DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (H_p, r)-INVEX FUNCTIONS

Jayswal¹,

Ismail²,

Prasad³

2014

Journal of applied mathematics & informatics

View full text Add to dashboard Cite

show abstract

A sixth bibliography of fractional programming

Cited by 58 publications

References 232 publications

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

A practical nonlinear dynamic framework for solving a class of fractional programming problems

DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (H_p, r)-INVEX FUNCTIONS

Contact Info

Product

Resources

About

A sixth bibliography of fractional programming

Cited by 58 publications

References 232 publications

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

A practical nonlinear dynamic framework for solving a class of fractional programming problems

DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (Hp, r)-INVEX FUNCTIONS

Contact Info

Product

Resources

About

DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (H_p, r)-INVEX FUNCTIONS