American Institute of Mathematical Sciences

Advanced
October  2005, 1(4): 477-486. doi: 10.3934/jimo.2005.1.477

Linear fractional vector optimization problems with many components in the solution sets

Tran Ninh Hoa 1, , Ta Duy Phuong 2, and  Nguyen Dong Yen 2,

1. 

Hanoi-Amsterdam High School, Hanoi, Vietnam
2. 

Institute of Mathematics, 18 Hoang Quoc Viet Rd., 10307 Hanoi, Vietnam, Vietnam

Received  May 2004 Revised  December 2004 Published  October 2005

Linear fractional vector optimization (LFVO) problems form a special class of nonconvex multiobjective optimization problems which has a significant role both in the management science and in the theory of vector optimization. Up to now, only LFVO problems with at most two connected components in the solution sets have been discussed in the literature. We propose some examples of LFVO problems with three or more connected components in the solution sets. It is proved that for any integer $m$ there exist LFVO problems with $m$ objective criteria whose solution sets have exactly $m$ connected components. Besides, we have solved the conjecture saying that $\chi(E(\mbox{P}))\leq \min\{m,\mbox{dim}0^+D+1\},$ where $\chi(E(\mbox{P}))$ is the number of connected components in the efficient solution set of a LFVO problem $(\mbox{P})$, $m$ is the number of the objective criteria of $(\mbox{P})$, and $\mbox{dim}0^+D$ is the dimension of the recession cone $0^+D$ of the feasible domain $D$ of $(\mbox{P})$. These new facts are useful for analyzing the practical problems which can be modeled as quasiconcave vector maximization problems in general, and as LFVO problems on unbounded feasible domains in particular.
Keywords: weakly efficient solution set, efficient solution set, recession cone., Linear fractional vector optimization, number of connected components.
Mathematics Subject Classification: Primary: 90C29; Secondary: 90C2.
Citation: Tran Ninh Hoa, Ta Duy Phuong, Nguyen Dong Yen. Linear fractional vector optimization problems with many components in the solution sets. Journal of Industrial & Management Optimization, 2005, 1 (4) : 477-486. doi: 10.3934/jimo.2005.1.477
[1]

Guolin Yu. Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps. Numerical Algebra, Control & Optimization, 2016, 6 (1) : 35-44. doi: 10.3934/naco.2016.6.35
[2]

Tran Ngoc Thang, Nguyen Thi Bach Kim. Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1417-1433. doi: 10.3934/jimo.2016.12.1417
[3]

Yasmine Cherfaoui, Mustapha Moulaï. Biobjective optimization over the efficient set of multiobjective integer programming problem. Journal of Industrial & Management Optimization, 2017, 13 (5) : 0-0. doi: 10.3934/jimo.2019102
[4]

Chaabane Djamal, Pirlot Marc. A method for optimizing over the integer efficient set. Journal of Industrial & Management Optimization, 2010, 6 (4) : 811-823. doi: 10.3934/jimo.2010.6.811
[5]

C. R. Chen, S. J. Li. Semicontinuity of the solution set map to a set-valued weak vector variational inequality. Journal of Industrial & Management Optimization, 2007, 3 (3) : 519-528. doi: 10.3934/jimo.2007.3.519
[6]

A. Domoshnitsky. About maximum principles for one of the components of solution vector and stability for systems of linear delay differential equations. Conference Publications, 2011, 2011 (Special) : 373-380. doi: 10.3934/proc.2011.2011.373
[7]

Guolin Yu. Topological properties of Henig globally efficient solutions of set-valued problems. Numerical Algebra, Control & Optimization, 2014, 4 (4) : 309-316. doi: 10.3934/naco.2014.4.309
[8]

Henri Bonnel, Ngoc Sang Pham. Nonsmooth optimization over the (weakly or properly) Pareto set of a linear-quadratic multi-objective control problem: Explicit optimality conditions. Journal of Industrial & Management Optimization, 2011, 7 (4) : 789-809. doi: 10.3934/jimo.2011.7.789
[9]

Alireza Ghaffari Hadigheh, Tamás Terlaky. Generalized support set invariancy sensitivity analysis in linear optimization. Journal of Industrial & Management Optimization, 2006, 2 (1) : 1-18. doi: 10.3934/jimo.2006.2.1
[10]

Behrouz Kheirfam, Kamal mirnia. Comments on ''Generalized support set invariancy sensitivity analysis in linear optimization''. Journal of Industrial & Management Optimization, 2008, 4 (3) : 611-616. doi: 10.3934/jimo.2008.4.611
[11]

Yong Wang, Wanquan Liu, Guanglu Zhou. An efficient algorithm for non-convex sparse optimization. Journal of Industrial & Management Optimization, 2019, 15 (4) : 2009-2021. doi: 10.3934/jimo.2018134
[12]

Ying Gao, Xinmin Yang, Jin Yang, Hong Yan. Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps. Journal of Industrial & Management Optimization, 2015, 11 (2) : 673-683. doi: 10.3934/jimo.2015.11.673
[13]

Manuel Fernández-Martínez. A real attractor non admitting a connected feasible open set. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 723-725. doi: 10.3934/dcdss.2019046
[14]

Rui Qian, Rong Hu, Ya-Ping Fang. Local smooth representation of solution sets in parametric linear fractional programming problems. Numerical Algebra, Control & Optimization, 2019, 9 (1) : 45-52. doi: 10.3934/naco.2019004
[15]

Yu Zhang, Tao Chen. Minimax problems for set-valued mappings with set optimization. Numerical Algebra, Control & Optimization, 2014, 4 (4) : 327-340. doi: 10.3934/naco.2014.4.327
[16]

Savin Treanţă. Characterization of efficient solutions for a class of PDE-constrained vector control problems. Numerical Algebra, Control & Optimization, 2020, 10 (1) : 93-106. doi: 10.3934/naco.2019035
[17]

Jiawei Chen, Guangmin Wang, Xiaoqing Ou, Wenyan Zhang. Continuity of solutions mappings of parametric set optimization problems. Journal of Industrial & Management Optimization, 2020, 16 (1) : 25-36. doi: 10.3934/jimo.2018138
[18]

Erik Kropat, Silja Meyer-Nieberg, Gerhard-Wilhelm Weber. Singularly perturbed diffusion-advection-reaction processes on extremely large three-dimensional curvilinear networks with a periodic microstructure -- efficient solution strategies based on homogenization theory. Numerical Algebra, Control & Optimization, 2016, 6 (2) : 183-219. doi: 10.3934/naco.2016008
[19]

Nguyen Van Thoai. Decomposition branch and bound algorithm for optimization problems over efficient sets. Journal of Industrial & Management Optimization, 2008, 4 (4) : 647-660. doi: 10.3934/jimo.2008.4.647
[20]

Lipu Zhang, Yinghong Xu, Zhengjing Jin. An efficient algorithm for convex quadratic semi-definite optimization. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 129-144. doi: 10.3934/naco.2012.2.129

2018 Impact Factor: 1.025

Tools

Metrics

  • PDF downloads (24)
  • HTML views (0)
  • Cited by (5)

Other articles
by authors

[Back to Top]

Copyright © 2020 American Institute of Mathematical Sciences