A multi-objective optimization problem (MOP) is a simultaneous of more than one real-valued conflicting objective function subject to some constraints. Most MOP algorithms try provide set Pareto optimal solutions which are equally good in terms the functions. The can be infinite, and hence, analysis choice task or several among hard for decision maker (DM). In this paper, new scalarization appr...

We consider the problems of computing the power and exponential moments EXs and EetX of square Gaussian random matrices X = A+BWC for positive integer s and real t, whereW is a standard normal random vector and A, B, C are appropriately dimensioned constantmatrices.We solve the problems by amatrix product scalarization technique and interpret the solutions in system-theoretic terms. The results...

In this paper, the existence theorems of solutions for generalized weak vector equilibrium problems are developed in real reflexive Banach spaces. Based on recession method and scalarization technique, we derive a characterization of nonemptiness and boundedness of solution set for generalized weak vector equilibrium problems. Moreover, Painlevé-Kuratowski upper convergence of solution set is a...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

A concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $K$...

Benefitting from the unequaled precision of pulsar timing technique, binary pulsars are important testbeds gravity theories, providing some tightest bounds on alternative theories gravity. One class well-motivated scalar-tensor gravity, predict large deviations general relativity for neutron stars through a nonperturbative phenomenon known as spontaneous scalarization. This effect, which cannot...

We present a new family of exact black hole configurations, which is solution to generalized Einstein-Maxwell-Dilaton setup in arbitrary dimension. These solutions are asymptotically Lifshitz for any dynamical critical exponent $z\ensuremath{\ge}1$. It turns out that the existence nontrivial scalar field direct consequence breaking spacetime isotropic scaling symmetry. This accepts various inte...

A new parameterized binary relation is used to define minimality concepts in vector optimization. To simplify the problem of determining minimal elements the method of scalarization is applied. Necessary and sufficient conditions for the existence of minimal elements with respect to the scalarized problems are given. The multiplier rule of Lagrange is generalized. As a necessary minimality cond...