A New Approach for Easy Computation by using ?-Matrix for solving Integer Linear Fractional Programming Problems

Seerengasamy, V.; Jeyaraman, K.

doi:10.5120/11855-7622

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yue et al [44] combined the Glover linearization scheme [13] with the Charnes-Cooper transformation, and thus proposed a new and effective reconstruction computation-linearization method. Seerengasamy and Jeyaraman [33] proposed a simple optimization method to solve the MILFP by using θ-matrix. If all integer constraints in MIQCQFP are removed, the problem is called quadratically constrained quadratic fractional programming (QCQFP) problem.…”

Section: Introductionmentioning

confidence: 99%

A New Global Optimization Algorithm for Mixed-Integer Quadratically Constrained Quadratic Fractional Programming Problem

Zhang¹,

Gao²,

Huang³

2024

JCM

View full text Add to dashboard Cite

The mixed-integer quadratically constrained quadratic fractional programming (MIQC-QFP) problem often appears in various fields such as engineering practice, management science and network communication. However, most of the solutions to such problems are often designed for their unique circumstances. This paper puts forward a new global optimization algorithm for solving the problem MIQCQFP. We first convert the MIQC-QFP into an equivalent generalized bilinear fractional programming (EIGBFP) problem with integer variables. Secondly, we linearly underestimate and linearly overestimate the quadratic functions in the numerator and the denominator respectively, and then give a linear fractional relaxation technique for EIGBFP on the basis of non-negative numerator. After that, combining rectangular adjustment-segmentation technique and midpointsampling strategy with the branch-and-bound procedure, an efficient algorithm for solving MIQCQFP globally is proposed. Finally, a series of test problems are given to illustrate the effectiveness, feasibility and other performance of this algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Global Optimization Algorithm for Mixed-Integer Quadratically Constrained Quadratic Fractional Programming Problem

Zhang¹,

Gao²,

Huang³

2024

JCM

View full text Add to dashboard Cite

show abstract

A New Approach for Easy Computation by using ?-Matrix for solving Integer Linear Fractional Programming Problems

Abstract: To minimize the computational effort needed in solving a Integer Linear Fractional programming problem a new approach has been proposed. Here we use  matrix for finding the solution of the integer linear fractional programming problems.

Cited by 1 publication

References 6 publications

A New Global Optimization Algorithm for Mixed-Integer Quadratically Constrained Quadratic Fractional Programming Problem

A New Global Optimization Algorithm for Mixed-Integer Quadratically Constrained Quadratic Fractional Programming Problem

Contact Info

Product

Resources

About