Registered Data

[CT166]

  • Session Time & Room
    • CT166 (1/1) : 3C @A201 [Chair: Zhibin Deng]
  • Classification
    • CT166 (1/1) : Mathematical programming (90C) / Operations research and management science (90B)

[02298] New semidefinite relaxations for a class of complex quadratic programming problems

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A201
  • Type : Contributed Talk
  • Abstract : In this talk, we propose some new semide finite relaxations for a class of nonconvex complex quadratic programming problems, widely appear in signal processing and power system. By deriving new valid constraints to the matrix variables in the lifted space, we derive some enhanced semide finite relaxations of complex quadratic programming problems. Then, we compare the proposed semide finite relaxations with existing ones, and show that the newly proposed semide finite relaxations could be strictly tighter than the previous ones. Numerical results indicate that the proposed semidefi nite relaxations not only provide tighter relaxation bounds but also improve some existing approximation algorithms by finding better sub-optimal solutions.
  • Classification : 90C20, 90C22, 90C35
  • Format : Talk at Waseda University
  • Author(s) :
    • Zhibin Deng (University of Chinese Academy of Sciences)
    • Yinzhe Xu (North China Electric Power University)
    • Cheng Lu (North China Electric Power University)
    • Yafeng Liu (Chinese Academy of Sciences)

[01034] Machine Learning for Two-stage Robust Optimization

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A201
  • Type : Contributed Talk
  • Abstract : When dealing with problems under uncertainty, two-stage robust optimization is one of the key approaches: you obtain an optimal robust solution, and adapt to the real scenario. However, these problems are one of the hardest optimization problem classes. To accelerate finding high-quality solutions, we propose a machine learning-based strategy. We experimentally show that with using our strategy you can train based on small problems, and apply them to bigger problems, while still getting good results.
  • Classification : 90C17, 90C90
  • Format : Talk at Waseda University
  • Author(s) :
    • Esther Julien (Delft University of Technology)
    • Krzysztof Postek (Delft University of Technology)
    • Ilker Birbil (University of Amsterdam)

[02443] Enhanced charge-based algorithm and its application in reliability-redundancy allocation problems

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A201
  • Type : Contributed Talk
  • Abstract : Reliability-redundancy allocation problems (RRAP) require selecting components with diverse choices and redundancy levels that maximize profit within constraints. The nonlinearity and non-smoothness in RRAP have defeated many traditional mathematical approaches. Therefore, in this paper, a new version of the charge-based artificial electric field algorithm (AEFA) is proposed, incorporating a novel Coulomb's constant and bounds. This restructuring improves the adaptability of AEFA on RRAPs. The suggested algorithm outperforms other existing algorithms on seven RRAPs.
  • Classification : 90C15, 90B25, 90C29, 90C06, 90C26
  • Author(s) :
    • Dikshit Chauhan (Dr B R Ambedkar National Institute of Technology Jalandhar)
    • Anupam Yadav (Dr B R Ambedkar National Institute of Technology Jalandhar)

[02511] Autocratic Decision-Making based on Neutrosophic Sets for Machine Selection in the Industrial Factories

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A201
  • Type : Industrial Contributed Talk
  • Abstract : Neutrosophic Sets address ambiguity by considering the levels of truth, falsity, and indeterminacy. This research proposes an autocratic strategy for dealing with Multi-Attribute Decision-Making problems in the neutrosophic environment. The method is adopted to handle machine selection problems to stimulate both production level and income creation, in which executives utilize neutrosophic values to estimate the determination levels of the characteristics. Analytical examinations demonstrate that the offered approach is more efficient than the other existing methods.
  • Classification : 90B50, 65Kxx
  • Format : Talk at Waseda University
  • Author(s) :
    • Amirhossein Nafei (National Taipei University of technology, Taipei , Taiwan )
    • Seyed Hadi Nasseri Ojaki (Department of mathematics, University of Mazandaran, Babolsar, Iran )

[02652] A multi-parametric approach for solid transportation problem under uncertainty conditions

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A201
  • Type : Contributed Talk
  • Abstract : Since most real-life issues take place in an imprecise environment, the uncertain parameters of models based on these issues are also more realistic. In the meantime, transportation issues are no exception. Uncertainty in solid transportation problems is one of the most important issues of the economy of each country and one of the applied issues in operations research too. In this research, we present a new two-phase approach based on the parametric method for solving solid transportation problem with fuzzy objective coefficients and flexible constraints. In this method, better use of resources is done, and it achieved the maximum satisfaction level.
  • Classification : 90B50
  • Author(s) :
    • Seyed Hadi Nasseri Ojaki (Department of Mathematics Department of applied mathematics, University of Mazandaran )
    • Amirhossein Nafei (National Taipei University of technology, Taipei , Taiwan )
    • Seyedeh Zehra Nasseri Ojaki (Department of Computer Engineering, Noshirvani University of Technology, Babol, Iran )