Browse > Article
http://dx.doi.org/10.22771/nfaa.2021.26.01.04

SOLUTION SETS OF SECOND-ORDER CONE LINEAR FRACTIONAL OPTIMIZATION PROBLEMS  

Kim, Gwi Soo (Department of Applied Mathematics, Pukyong National University)
Kim, Moon Hee (College of General Education, Tongmyong University)
Lee, Gue Myung (Department of Applied Mathematics, Pukyong National University)
Publication Information
Nonlinear Functional Analysis and Applications / v.26, no.1, 2021 , pp. 65-70 More about this Journal
Abstract
We characterize the solution set for a second-order cone linear fractional optimization problem (P). We present sequential Lagrange multiplier characterizations of the solution set for the problem (P) in terms of sequential Lagrange multipliers of a known solution of (P).
Keywords
Second-order cone linear fractional optimization problem; optimality conditions; solution set;
Citations & Related Records
연도 인용수 순위
  • Reference
1 F. Alizadeh and D. Goldfarb, Second-order cone programming, ISMP 2000, Part 3 (Atlanta, GA), Math. Program., 95 (2003), Ser. B, 3-51.   DOI
2 M.H. Kim, G.S. Kim and G.M. Lee, On semidefinite linear fractional optimization problems, accepted for publication.
3 G.S. Kim, M.H. Kim and G.M. Lee, On optimality and duality for second-order cone linear fractional optimization problems, accepted for publication.
4 V. Jeyakumar, G. M. Lee and N. Dinh, New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs, SIAM J. Optim., 14 (2003), 534-547.   DOI
5 V. Jeyakumar, G.M. Lee and N. Dinh, Lagrange multiplier conditions characterizing optimal solution sets of cone-constrained convex programs, J. Optim. Theory Appl., 123 (2004), 83-103.   DOI
6 J.V. Burke and M. Ferris, Characterization of solution sets of convex programs, Oper. Res. Lett., 10 (1991), 57-60.   DOI
7 M. Castellani and M. Giuli, A characterization of the solution set of pseudoconvex extremum problems, J. Convex Anal., 19 (2012), 113-123.
8 V. Jeyakumar, G.M. Lee and N. Dinh, Lagrange multiplier conditions characterizing optimal solution sets of cone-constrained convex programs, J. Optim. Theory Appl., 123 (2004), 83-103.   DOI
9 V. Jeyakumar, G.M. Lee and N. Dinh, Characterizations of solution sets of convex vector minimization problems, Eur. J. Oper. Res., 174 (2006), 1380-1395.   DOI
10 V. Jeyakumar, G,M. Lee and G. Li, Characterizing robust solution sets of convex programs under data uncertainty, J. Optim. Theory Appl., 164 (2015), 407-435.   DOI
11 V. Jeyakumar and X.Q. Yang, On characterizing the solution sets of pseudolinear programs, J. Optim. Theory Appl. 87 (1995), 747-755.   DOI
12 C.S. Lalitha and M. Mehta, Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers, Optimization, 58 (2009), 995-1007.   DOI
13 J.P. Penot, Characterization of solution sets of quasiconvex programs, J. Optim. Theory Appl., 117 (2003), 627-636.   DOI
14 T.Q. Son and N. Dinh, Characterizations of optimal solution sets of convex infinite programs, TOP. 16 (2008), 147-163.   DOI
15 Z.L. Wu and S.Y. Wu, Characterizations of the solution sets of convex programs and variational inequality problems, J. Optim. Theory Appl., 130 (2006), 339-358.
16 K.Q. Zhao and X.M. Yang, Characterizations of the solution set for a class of nonsmooth optimization problems, Optim. Lett., 7 (2013), 685-694.   DOI
17 O.L. Mangasarian, A simple characterization of solution sets of convex programs, Oper. Res. Lett., 7 (1988), 21-26.   DOI