ε-strongly Efficient Solutions for Vector Optimization with Set-valued Maps

In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.

On vector variational-like inequalities and vector optimization problems with (G, α)-invexity

The aim of this paper is to study the relationship among Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and vector optimization problem involving (G, α)-invex functions. Furthermore, we establish equivalence among the solutions of weak formulations of Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and weak efficient solution of vector optimization problem under the assumption of (G, α)-invex functions. Examples are provided to elucidate our results.

Generalized cone-subconvexlike set-valued maps and applications to vector optimization

The definitions of cone-subconvexlike set-valued maps and generalized cone-subconvexlike set-valued maps in topological vector spaces are defined by using the relative interiors of ordering cone. The relationships between the two classes of set-valued maps are investigated, and some properties of them are shown. A Gordan type alternative theorem under the assumption of generalized cone-subconvexlikeness of set-valued maps is proved by applying convex separation theorems involving the relative interiors in infinite dimensional spaces. Finally a necessary optimality condition theorem is shown for a general kind of set-valued vector optimization in a sense of weak E-minimizer.

Optimality of Vector Optimization Involving Generalized Type-I Functions in Banach

In this note,new classes of generalized type-I functions are introduced for functions between Banach spaces.These generalized type-I functions are then utilized to establish sufficient optimality conditions and duality results for a vector optimization problem with functions defined on a Banach space.

Solving chemical dynamic optimization problems with ranking-based differential evolution algorithms

Dynamic optimization problems(DOPs) described by differential equations are often encountered in chemical engineering. Deterministic techniques based on mathematic programming become invalid when the models are non-differentiable or explicit mathematical descriptions do not exist. Recently, evolutionary algorithms are gaining popularity for DOPs as they can be used as robust alternatives when the deterministic techniques are invalid. In this article, a technology named ranking-based mutation operator(RMO) is presented to enhance the previous differential evolution(DE) algorithms to solve DOPs using control vector parameterization. In the RMO, better individuals have higher probabilities to produce offspring, which is helpful for the performance enhancement of DE algorithms. Three DE-RMO algorithms are designed by incorporating the RMO. The three DE-RMO algorithms and their three original DE algorithms are applied to solve four constrained DOPs from the literature. Our simulation results indicate that DE-RMO algorithms exhibit better performance than previous non-ranking DE algorithms and other four evolutionary algorithms.

Robust Source Localization in Shallow Water Based on Vector Optimization

Owing to the multipath effect, the source localization in shallow water has been an area of active interest. However, most methods for source localization in shallow water are sensitive to the assumed model of the underwater environment and have poor robustness against the underwater channel uncertainty, which limit their further application in practical engineering. In this paper, a new method of source localization in shallow water, based on vector optimization concept, is described, which is highly robust against environmental factors affecting the localization, such as the channel depth, the bottom reflection coefficients, and so on. Through constructing the uncertainty set of the source vector errors and extracting the multi-path sound rays from the sea surface and bottom, the proposed method can accurately localize one or more sources in shallow water dominated by multipath propagation. It turns out that the natural formulation of our approach involves minimization of two quadratic functions subject to infinitely many nonconvex quadratic constraints. It shows that this problem （originally intractable） can be reformulated in a convex form as the so-called second-order cone program （SOCP） and solved efficiently by using the well-established interior point method, such as the sottware tool, SeDuMi. Computer simulations show better performance of the proposed method as compared with existing algorithms and establish a theoretical foundation for the practical engineering application.

NON-CONFLICTING ORDERING CONES AND VECTOR OPTIMIZATION IN INDUCTIVE LIMITS

Let （E,ξ）=ind（En,ξn） be an inductive limit of a sequence （En,ξn）n∈N of locally convex spaces and let every step （En,ξn） be endowed with a partial order by a pointed convex （solid） cone Sn. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence （Sn）n∈N of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.

Systems of generalized vector quasi-variational inclusions and systems of generalized vector quasi-optimization problems in locally FC-uniform spaces

In this paper, we introduce some new systems of generalized vector quasi-variational inclusion problems and system of generalized vector ideal （resp., proper, Pareto, weak） quasi-optimization problems in locally FC-uniform spaces without convexity structure. By using the KKM type theorem and Himmelberg type fixed point theorem proposed by the author, some new existence theorems of solutions for the systems of generalized vector quasi-variational inclusion problems are proved. As to its applications, we obtain some existence results of solutions for systems of generalized vector quasi-optimization problems.

Mathematical Apparatus for Selection of Optimal Parameters of Technical, Technological Systems and Materials Based on Vector Optimization

We presented Mathematical apparatus of the choice of optimum parameters of technical, technological systems and materials on the basis of vector optimization. We have considered the formulation and solution of three types of tasks presented below. First, the problem of selecting the optimal parameters of technical systems depending on the functional characteristics of the system. Secondly, the problem of selecting the optimal parameters of the process depending on the technological characteristics of the process. Third, the problem of choosing the optimal structure of the material depending on the functional characteristics of this material. The statement of all problems is made in the form of vector problems of mathematical (nonlinear) programming. The theory and the principle of optimality of the solution of vector tasks it is explained in work of https://rdcu.be/bhZ8i. The implementation of the methodology is shown on a numerical example of the choice of optimum parameters of the technical, technological systems and materials. On the basis of mathematical methods of solution of vector problems we developed the software in the MATLAB system. The numerical example includes: input data (requirement specification) for modeling;transformation of mathematical models with uncertainty to the model under certainty;acceptance of an optimal solution with equivalent criteria (the solution of numerical model);acceptance of an optimal solution with the given priority of criterion.

The Optimization of Radio over Fiber Link by Proper Link Gain Control

we demonstrate the adjustability of optimal input power(OIP) of the radio over fiber(RoF) link by proper link gain control in the central unit(CU) and remote antenna unit(RAU).The experiment results show that the reading and writing distance(RWD)of the radio frequency identification(RFID)service and the throughput of the WiFi service have a max increase of 3cm and 6.975Mbit/s respectively when the OIP value equals to output power of commercial products,compared with OIP value with 5-dBm right/left shift to the output power.

Multiobjective Decision Making: the Combined Approach

In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships with other four approaches: weighting approach, sequential approach, ε-constraint approach and hybrid approach, are discussed. Based on this combined approach, a decision-making support method called the Combined Decision-Making Method (CDMM) for multiobjective problems is developed, which is an interactive process with the decision maker. Only the aspiration levels, which reflect the decision maker's satisfying degrees for corresponding objectives, are needed to be supplied by the decision maker step by step as he will. This interactive way for objectives can easily be accepted. Finally, the application of the proposed decision making method in the resource allocation problem is discussed, and an example for the production decision analysis of the solar energy cells given.

Equilibrium solution of two enterprises cooperative game

Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capability to deviate the allocation of interests from the equilibrium point. If some firm tries to withdraw from cooperation or threaten to use other particular strategy, the negotiations are likely to achieve the distribution by the threat game; The calculating method of the choice of the optimal bargaining base point and the corresponding optimal pay-off vector are given.

Comparison of Constant and Time-variant Optimal Forcing Approaches in El Nio Simulations by Using the Zebiak–Cane Model

Model errors offset by constant and time-variant optimal forcing vector approaches （termed COF and OFV, respectively） are analyzed within the framework of E1 Nifio simulations. Applying the COF and OFV approaches to the well-known Zebiak-Cane model, we re-simulate the 1997 and 2004 E1 Nifio events, both of which were poorly degraded by a certain amount of model error when the initial anomalies were generated by coupling the observed wind forcing to an ocean com- ponent. It is found that the Zebiak-Cane model with the COF approach roughly reproduced the 1997 E1 Nifio, but the 2004 E1 Nifio simulated by this approach defied an ENSO classification, i.e., it was hardly distinguishable as CP-E1 Nifio or EP-E1 Nifio. In hoth E1 Nifio simulations, substituting the COF with the OFV improved the fit between the simulations and obser- vations because the OFV better manages the time-variant errors in the model. Furthermore, the OFV approach effectively corrected the modeled E1 Nifio events even when the observational data （and hence the computational time） were reduced. Such a cost-effective offset of model errors suggests a role for the OFV approach in complicated CGCMs.

Density-wave tendency from a topological nodal-line perspective

The understanding of density waves is a vital component of our insight into electronic quantum matters. Here, we propose an additional mosaic to the existing mechanisms such as Fermi-surface nesting, electron–phonon coupling, and exciton condensation. In particular, we find that certain two-dimensional(2D) spin density-wave systems are equivalent to three-dimensional(3D) Dirac nodal-line systems in the presence of a magnetic field, whose electronic structure takes the form of Dirac-fermion Landau levels and allows a straightforward analysis of its optimal filling. The subsequent minimumenergy wave vector varies over a continuous range and shows no direct connection to the original Fermi surfaces in 2D.Also, we carry out numerical calculations where the results on model examples support our theory. Our study points out that we have yet to attain a complete understanding of the emergent density wave formalism.

Improved color feature arrangement for mean shift tracking

In order to reduce redundant empty bin capacity arrangement mechanism for mean shift tracking objects in the probability representation, we present a new color feature In the proposed mechanism, the important optimal color, or we call it optimal color vector, is clustered by closing Euclidean distance which happens inside the original RGB color 3-D spatial domain. After obtaining clustering colors from the reference image RGB spatial domain, novel clustering groups substitute for original color data. So the new color substitution distribution is as similar as the original one. And then target region in the candidate frame is mapped by the constructed optimal clustering colors and the cluster Indices. In the final, mean shift algorithm gives a performance in the new optimal color distribution. Comparison under the same circumstance between the proposed algorithm and conventional mean shift algorithm shows that the former has a certain advantage in computation cost.

Stability of Generalized Minimax Regret Equilibria with Scalar Set Payoff

In this paper, we first introduce the notion and model of generalized minimax regret equilibria with scalar set payoffs. After that, we study its general stability theorem under the conditions that the existence theorem of generalized minimax regret equilibrium point with scalar set payoffs holds. In other words, when the scalar set payoffs functions and feasible constraint mappings are slightly disturbed, by using Fort theorem and continuity results of set-valued mapping optimal value functions, we obtain a general stability theorem for generalized minimax regret equilibria with scalar set payoffs. At the same time, an example is given to illustrate our result.

Costless-Function Model Predictive Current Control of Seven-Phase PMSM to Improve Dynamic Performance and Suppress Harmonics of Marine Electric Propulsion System

In order to improve the dynamic performance and suppress current harmonic for seven-phase PMSM(permanent magnet synchronous motor),this paper proposed an MPCC(mode predict current control)scheme based on SVPWM(space vector pulse width modulation)technique.By this scheme,the 14 virtual voltage vectors are first calculated based on the principle:the voltage vector synthesized in the 3rd harmonic subspace and the 5th harmonic subspace should be zero,in each sampling period,the optimal voltage vector is directly selected from the 14 virtual voltage vectors to achieve the best output current performance of seven-phase PMSM.In addition,no cost function related calculations are required in the MPCC scheme,reducing the calculation time and improving the dynamic response of the system.The simulation model of the seven-phase PMSM vector control system is established by using the Simulink tool of MATLAB,and the effectiveness of the scheme will be presented.

Intelligent Forecasting of Sintered Ore’s Chemical Components Based on SVM

Using object mathematical model of traditional control theory can not solve the forecasting problem of the chemical components of sintered ore.In order to control complicated chemical components in the manufacturing process of sintered ore,some key techniques for intelligent forecasting of the chemical components of sintered ore are studied in this paper.A new intelligent forecasting system based on SVM is proposed and realized.The results show that the accuracy of predictive value of every component is more than 90%.The application of our system in related companies is for more than one year and has shown satisfactory results.

Henig Efficiency in Vector Optimization with Nearly Cone-subconvexlike Set-valued Functions

In this paper, we study Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued function. The existence of Henig efficient point is proved and characterization of Henig efficiency is established using the method of Lagrangian multiplier. As an interesting application of the results in this paper, we establish a Lagrange multiplier theorem for super efficiency in vector optimization with nearly conesubconvexlike set-valued function.

TOPOLOGICAL STRUCTURE OF EFFICIENT SET OF OPTIMIZATION PROBLEM OF SET－VALUED MAPPING

This paper is concerned with the topological structure of efficient sets for optimizationproblem of set-valued mapping. It is proved that these sets are closed or. connected under someconditions on cone-continuity, cone-convexity and cone-quasiconvexity.