Outer Bounds for the Parametric Controllable Solution Set with Linear Shape

2016 ◽  
pp. 138-147 ◽  
Author(s):  
Evgenija D. Popova
Keyword(s):  
Solution Set ◽  
Outer Bounds ◽  
Linear Shape

scholarly journals Inner and outer bounds for the solution set of parametric linear systems

2007 ◽  
Vol 199 (2) ◽  
pp. 310-316 ◽  
Author(s):  
Evgenija Popova ◽  
Walter Krämer
Keyword(s):  
Linear Systems ◽  
Solution Set ◽  
Outer Bounds

scholarly journals Multi-Objective Whale Optimization Algorithm for Computation Offloading Optimization in Mobile Edge Computing

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2628
Author(s):  
Mengxing Huang ◽  
Qianhao Zhai ◽  
Yinjie Chen ◽  
Siling Feng ◽  
Feng Shu
Keyword(s):  
Optimization Algorithm ◽  
Edge Computing ◽  
Solution Set ◽  
Whale Optimization Algorithm ◽  
Computation Offloading ◽  
Mobile Edge Computing ◽  
Multi Objective ◽  
Whale Optimization ◽  
Artificial Immune System Algorithm

Computation offloading is one of the most important problems in edge computing. Devices can transmit computation tasks to servers to be executed through computation offloading. However, not all the computation tasks can be offloaded to servers with the limitation of network conditions. Therefore, it is very important to decide quickly how many tasks should be executed on servers and how many should be executed locally. Only computation tasks that are properly offloaded can improve the Quality of Service (QoS). Some existing methods only focus on a single objection, and of the others some have high computational complexity. There still have no method that could balance the targets and complexity for universal application. In this study, a Multi-Objective Whale Optimization Algorithm (MOWOA) based on time and energy consumption is proposed to solve the optimal offloading mechanism of computation offloading in mobile edge computing. It is the first time that MOWOA has been applied in this area. For improving the quality of the solution set, crowding degrees are introduced and all solutions are sorted by crowding degrees. Additionally, an improved MOWOA (MOWOA2) by using the gravity reference point method is proposed to obtain better diversity of the solution set. Compared with some typical approaches, such as the Grid-Based Evolutionary Algorithm (GrEA), Cluster-Gradient-based Artificial Immune System Algorithm (CGbAIS), Non-dominated Sorting Genetic Algorithm III (NSGA-III), etc., the MOWOA2 performs better in terms of the quality of the final solutions.

Nonlocal fractional semilinear differential inclusions with noninstantaneous impulses and of order α ∈ (1, 2)

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
JinRong Wang ◽  
Ahmed G. Ibrahim ◽  
Donal O’Regan ◽  
Adel A. Elmandouh
Keyword(s):  
Differential Inclusions ◽  
Mild Solutions ◽  
Multivalued Function ◽  
Linear Operators ◽  
Solution Set ◽  
Cosine Family ◽  
Bounded Linear Operators ◽  
Bounded Linear ◽  
Noninstantaneous Impulses

AbstractIn this paper, we establish the existence of mild solutions for nonlocal fractional semilinear differential inclusions with noninstantaneous impulses of order α ∈ (1,2) and generated by a cosine family of bounded linear operators. Moreover, we show the compactness of the solution set. We consider both the case when the values of the multivalued function are convex and nonconvex. Examples are given to illustrate the theory.

scholarly journals Structure of Pareto Solutions of Generalized Polyhedral-Valued Vector Optimization Problems in Banach Spaces

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Qinghai He ◽  
Weili Kong
Keyword(s):  
Banach Spaces ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Solution Set ◽  
Pareto Optimal ◽  
Pareto Solution ◽  
Value Set ◽  
Set Valued Mapping ◽  
Optimal Value

In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra. Dropping the compactness assumption, we establish some results on structure of the weak Pareto solution set, Pareto solution set, weak Pareto optimal value set, and Pareto optimal value set of (SVOP) and on connectedness of Pareto solution set and Pareto optimal value set of (SVOP). In particular, we improved and generalize, Arrow, Barankin, and Blackwell’s classical results in Euclidean spaces and Zheng and Yang’s results in general Banach spaces.

Solution Set Properties for Errors-in-Variables Problems

1994 ◽  
Vol 27 (8) ◽  
pp. 1127-1132
Author(s):  
A.D.O. Anderson ◽  
M. Deistler
Keyword(s):  
Solution Set ◽  
Errors In Variables
Sign in / Sign up

Export Citation Format

Share Document