Global algorithm for solving linear multiplicative programming problems
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1378-z
Abstract: This article presents a rectangular branch-and-bound algorithm with standard bisection rule for solving linear multiplicative problem (LMP). In this algorithm, a novel linear relaxation technique is presented for deriving the linear relaxation programming of problem… read more here.
Keywords: problem lmp; linear multiplicative; programming problems; solving linear ... See more keywords
Global optimization algorithm for solving linear multiplicative programming problems
Sign Up to like & getrecommendations! Published in 2020 at "Optimization"
DOI: 10.1080/02331934.2020.1812603
Abstract: In this paper, a class of linear multiplicative problems (LMP) are considered, which cover many applications and are known to be NP-hard. For finding the globally optimal solution to problem (LMP) ... read more here.
Keywords: global optimization; algorithm solving; optimization; optimization algorithm ... See more keywords
An Accelerating Algorithm for Linear Multiplicative Programming Problem
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.3031354
Abstract: By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear relaxed programming… read more here.
Keywords: programming problem; linear multiplicative; multiplicative programming; problem ... See more keywords
Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation
Sign Up to like & getrecommendations! Published in 2018 at "Mathematical Problems in Engineering"
DOI: 10.1155/2018/9146309
Abstract: Applications of generalized linear multiplicative programming problems (LMP) can be frequently found in various areas of engineering practice and management science. In this paper, we present a simple global optimization algorithm for solving linear multiplicative… read more here.
Keywords: relaxation; multiplicative programming; generalized linear; convex relaxation ... See more keywords
A Combined Approach to Reducing the Pareto Set Using Linear or Multiplicative Scalarization
Sign Up to like & getrecommendations! Published in 2017 at "Scientific and Technical Information Processing"
DOI: 10.3103/s0147688217050094
Abstract: In this paper, the multicriteria choice problem, including the decision maker’s (DM) binary preference relation, is considered. Two combined two-stage approaches are proposed. According to these approaches, first, we have to reveal some information on… read more here.
Keywords: combined approach; pareto set; approach reducing; scalarization ... See more keywords