×

Solving a fractional program with second order cone constraint. (English) Zbl 1455.90139

Summary: Our main interest in the present article is to consider a fractional program with both linear and quadratic equation in numerator and denominator with second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, then the problem is reduced to a semi-definite optimization (SDO) program. The problem is solved with SDO relaxation and the obtained results are compared with the interior point method (IPM), sequential quadratic programming approach (SQP), active set, genetic algorithm. It is observe that the SDO relaxation method is much more accurate and faster than the other methods. Finally, two numerical examples are given to demonstrate the procedure for the proposed method to guarantee the approach.

MSC:

90C32 Fractional programming
90C46 Optimality conditions and duality in mathematical programming

Software:

SOCP
PDFBibTeX XMLCite
Full Text: Link

References:

[1] S. Kim, M. Kojima, Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations,Computational optimization and applications,26, (2003), 143-154. · Zbl 1043.90060
[2] A. Charnes, WW. Cooper, Programs with linear fractional functions,Naval Research Logistics Quarterly,9, (1962), 181-196. · Zbl 0127.36901
[3] SF. Tantawy, A new procedure for solving linear fractional programming problems,Journal of Mathematical and Computer Modeling,48, (2008), 969-973. · Zbl 1156.90445
[4] Y. Nesterov, A. Nemirovski,Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM publications, 1994. · Zbl 0824.90112
[5] A. Beck, M. Teboulle, A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid,Mathematical Programming,118(1), (2009), 13-35. · Zbl 1176.90451
[6] W. Dinkelbach, On nonlinear fractional programming,Management Science,13, (1967), 492-498. · Zbl 0152.18402
[7] MS. Lobo, L. Vandenberghe, S. Boyd, H. Lebret, Applications of second order cone programming,Linear Algebra Appl.,284, (1998), 193-228. · Zbl 0946.90050
[8] MS. Lobo, L. Vandenberghe, S. Boyd ,Socp: Software for Second-Order Cone Programming, Information Systems Laboratory, Stanford University, 1997.
[9] F. Alizadeh, D. Goldfarb, Second-order cone programming,Math. Program. Ser. B,95, (2003), 35-51. · Zbl 1153.90522
[10] M. Salahi, A short note onM inx∈Rnk1+Axk−xbkk22,Applied Mathematics and Computation, 212, (2009), 270-272. · Zbl 1166.65346
[11] M. Salahi, S. Fallahi, A semidefinite optimization approach to quadratic fractional optimization with a strictly convex quadratic constraint,Iranian Journal of Mathematical Sciences and Informatics,9(2), (2014), 65-71. · Zbl 1317.90292
[12] JF. Sturm, S. Zhang, On cones of nonnegative quadratic functions,Mathematics of Operations Research,28, (2003), 246-267. · Zbl 1082.90086
[13] S. Xian-Kai, T. Liping , L. Xian-Jun, L. Minghua, Some dual characterization of Farkastype results for fractional programming problems,Optimization Letters,12(6), (2018), 1403-1420. · Zbl 1396.90084
[14] S. Xian-Kai, L. Xian-Jun, F. Hong-Yong, L. Xiao-Bing, Some characterization of robust optimal solutions for uncertain fractional optimization and applications,Journal of industrial and management optimization,13(2), (2017), 803-824. · Zbl 1364.90308
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.