AN OPTIMAL CONTROL PROBLEM FOR A LOTKA-VOLTERRA COMPETITION MODEL WITH CHEMO-REPULSION

In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.

Optimization of Generator Based on Gaussian Process Regression Model with Conditional Likelihood Lower Bound Search

The noise that comes from finite element simulation often causes the model to fall into the local optimal solution and over fitting during optimization of generator.Thus,this paper proposes a Gaussian Process Regression(GPR)model based on Conditional Likelihood Lower Bound Search(CLLBS)to optimize the design of the generator,which can filter the noise in the data and search for global optimization by combining the Conditional Likelihood Lower Bound Search method.Taking the efficiency optimization of 15 kW Permanent Magnet Synchronous Motor as an example.Firstly,this method uses the elementary effect analysis to choose the sensitive variables,combining the evolutionary algorithm to design the super Latin cube sampling plan;Then the generator-converter system is simulated by establishing a co-simulation platform to obtain data.A Gaussian process regression model combing the method of the conditional likelihood lower bound search is established,which combined the chi-square test to optimize the accuracy of the model globally.Secondly,after the model reaches the accuracy,the Pareto frontier is obtained through the NSGA-II algorithm by considering the maximum output torque as a constraint.Last,the constrained optimization is transformed into an unconstrained optimizing problem by introducing maximum constrained improvement expectation(CEI)optimization method based on the re-interpolation model,which cross-validated the optimization results of the Gaussian process regression model.The above method increase the efficiency of generator by 0.76%and 0.5%respectively;And this method can be used for rapid modeling and multi-objective optimization of generator systems.

Optimization of Extraction Conditions of Pomegranate Peel Polyphenols and Its Protective Effect on Acute Alcoholic Liver Injury in Mice

[Objectives]This study was conducted to explore the optimization of ultrasonic-assisted organic solvent extraction of pomegranate peel polyphenols(PPPs),and to study the protective effect of PPPs on acute alcoholic liver injury in mice.[Methods]The optimal extraction conditions of PPPs were determined by single factor and orthogonal experiments,and an acute alcoholic liver injury model in mice was established.Bifendate was used as the positive control group to investigate the protective effect of low,medium and high doses of PPPs on acute alcoholic liver injury.[Results]The optimum extraction process parameters were followed as 60%ethanol concentration,solid-liquid ratio of 1:40(w/v),extraction temperature of 50℃,and extraction time of 1.5 h,and the yield was 1.42%.The results of animal experiments showed that PPPs could effectively reduce the degree of alcoholic liver injury in mice,reduce the levels of serum alanine aminotransferase(ALT)and aspartate aminotransferase(AST),and reduce the inflammation and necrosis of liver tissue in mice.Meanwhile,the total polyphenols from pomegranate peel also significantly reduced the expression levels of malondialdehyde(MDA),tumor necrosis factor(TNF-α)and interleukin-6(IL-6)in mice,and increased the levels of superoxide dismutase(SOD)and reduced glutathione(GSH)in liver tissue of mice,indicating its antioxidant and anti-inflammatory effects,further illustrating its protective effect on alcoholic liver injury.[Conclusions]PPPs could reduce the expression levels of TNF-α,IL-6 and MDA in mice,and increase the expression levels of SOD and GSH to achieve the protective effect on acute alcoholic liver injury in mice.This study will provide new ideas for the development of new anti-alcoholic liver injury drug resources.

Optimization of Extraction Conditions for Total Flavonoids from Fructus Aurantii Immaturus and Its Anti-UVB Radiation Activity

[Objectives]Optimum extraction conditions of total flavonoids from Fructus Aurantii Immaturus(TFFAI)and its resistance activity to ultraviolet radiation were investigated in present research.[Methods]The optimal extraction conditions of TFFAI were determined by single factor and orthogonal experiments,and the survival rate of TFFAI on HaCaT cells irradiated with UVB rays was investigated.It s antioxidant capacity was determined by ABTS.[Results]The results showed that the highest yield of TFFAI was obtained with 70%ethanol at a solid-to-liquid ratio of 1:50(w/v)and 40℃for 1.5 h by single-factor and orthogonal experiments.Total flavonoids(0.25-1.00 mg/ml)could significantly improve the survival rate of HaCaT cell line.Meanwhile,the maximum absorption peak of TFFAI was found at 283 nm,and in-vitro antioxidant experiment identified that TFFAI had a good clearance rate to ABTS.It suggestes that TFFAI could protect the cells from UVB damage by absorption of UVB rays and anti-oxidation.[Conclusions]TFFAI played a protective role on UVB irradiated cells through UVB ultraviolet absorption and antioxidant pathways.

SECOND-ORDER OPTIMALITY CONDITIONS FOR OPTIMAL CONTROL PROBLEMS GOVERNED BY 3-DIMENSIONAL NEVIER-STOKES EQUATIONS

This article is concerned with second-order necessary and sufficient optimality conditions for optimal control problems governed by 3-dimensional Navier-Stokes equations. The periodic state constraint is considered.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.

THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

The concepts of alpha-order Clarke's derivative, alpha-order Adjacent derivative and alpha-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Sufficient Optimality Conditions for Multiobjective Programming Involving (V, ρ)h,ψ-type Ⅰ Functions

New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.

Global optimality conditions for quadratic 0-1 programming with inequality constraints

Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.

Weak optimal inverse problems of interval linear programming based on KKT conditions

In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

Optimality Conditions and Duality for Nonsmooth Multiobjective Programms with Generalized Essential Convexity

In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution. We set up Mond-Weir type duality and Craven type duality for nonsmooth multiobjective programming with generalized essentially convex functions, and prove them.

PermissibleWind Conditions for Optimal Dynamic Soaring with a Small Unmanned Aerial Vehicle

Dynamic soaring is a flight maneuver to exploit gradient wind field to extend endurance and traveling distance.Optimal trajectories for permissible wind conditions are generated for loitering dynamic soaring as well as for traveling patterns with a small unmanned aerial vehicle.The efficient direct collection approach based on the Runge-Kutta integrator is used to solve the optimization problem.The fast convergence of the optimization process leads to the potential for real-time applications.Based on the results of trajectory optimizations,the general permissible wind conditions which involve the allowable power law exponents and feasible reference wind strengths supporting dynamic soaring are proposed.Increasing the smallest allowable wingtip clearance to trade for robustness and safety of the vehicle system and improving the maximum traveling speed results in shrunken permissible domain of wind conditions for loitering and traveling dynamic soaring respectively.Sensitivity analyses of vehicle model parameters show that properly reducing the wingspan and increasing the maximum lift-to-drag ratio and the wing loading can enlarge the permissible domain.Permissible domains for different traveling directions show that the downwind dynamic soaring benefitting from the drift is more efficient than the upwind traveling pattern in terms of permissible domain size and net traveling speed.

Optimal reaction conditions for pyridine synthesis in riser reactor

Pyridine has been generally synthesized by aldehydes and ammonia in a turbulent fluidized-bed reactor. In this paper, a novel riser reactor was proposed for pyridine synthesis. Experiment result showed that the yield of pyridine and 3-picoline decreased, but the selectivity of pyridine over 3-picoline increased compared to turbulent fluidized-bed reactor. Based on experimental data, a modified kinetic model was used for the determination of optimal operating condition for riser reactor. The optimal operating condition of riser reactor given by this modified model was as follows: The reaction temperature of 755 K, catalyst to feedstock ratio(CTFR) of 87, residence time of 3.8 s and initial acetaldehydes concentration of 0.0029 mol·L^(-1)(acetaldehydes to formaldehydes ratio by mole(ATFR) of 0.65 and ammonia to aldehydes ratio by mole(ATAR) of 0.9, water contention of 63 wt%(formaldehyde solution)).

Pareto-Optimal Reinsurance Based on TVaR Premium Principle and Vajda Condition

Reinsurance is an effective risk management tool for insurers to stabilize their profitability. In a typical reinsurance treaty, an insurer cedes part of the loss to a reinsurer. As the insurer faces an increasing number of total losses in the insurance market, the insurer might expect the reinsurer to bear an increasing proportion of the total loss, that is the insurer might expect the reinsurer to pay an increasing proportion of the total claim amount when he faces an increasing number of total claims in the insurance market. Motivated by this, we study the optimal reinsurance problem under the Vajda condition. To prevent moral hazard and reflect the spirit of reinsurance, we assume that the retained loss function is increasing and the ceded loss function satisfies the Vajda condition. We derive the explicit expression of the optimal reinsurance under the TVaR risk measure and TVaR premium principle from the perspective of both an insurer and a reinsurer. Our results show that the explicit expression of the optimal reinsurance is in the form of two or three interconnected line segments. Under an additional mild constraint, we get the optimal parameters and find the optimal reinsurance strategy is full reinsurance, no reinsurance, stop loss reinsurance, or quota-share reinsurance. Finally, we gave an example to analyze the impact of the weighting factor on optimal reinsurance.

Necessary Optimality Conditions for Multi-Objective Semi-Infinite Variational Problem

In this paper, necessary optimality conditions for a class of Semi-infinite Variational Problems are established which are further generalized to a class of Multi-objective Semi-Infinite Variational Problems. These conditions are responsible for the development of duality theory which is an extremely important feature for any class of problems, but the literature available so far lacks these necessary optimality conditions for the stated problem. A lemma is also proved to find the topological dual of as it is required to prove the desired result.

Optimality conditions in set optimization employing higher-order radial derivatives

There are two approaches of defining the solutions of a set-valued optimization problem： vector criterion and set criterion. This note is devoted to higher-order optimality conditions using both criteria of solutions for a constrained set-valued optimization problem in terms of higher-order radial derivatives. In the case of vector criterion, some optimality conditions are derived for isolated （weak） minimizers. With set criterion, necessary and sufficient optimality conditions are established for minimal solutions relative to lower set-order relation.

Solution Concepts and New Optimality Conditions in Bilevel Multiobjective Programming

In this paper, new sufficient optimality theorems for a solution of a differentiable bilevel multiobjective optimization problem (BMOP) are established. We start with a discussion on solution concepts in bilevel multiobjective programming;a theorem giving necessary and sufficient conditions for a decision vector to be called a solution of the BMOP and a proposition giving the relations between four types of solutions of a BMOP are presented and proved. Then, under the pseudoconvexity assumptions on the upper and lower level objective functions and the quasiconvexity assumptions on the constraints functions, we establish and prove two new sufficient optimality theorems for a solution of a general BMOP with coupled upper level constraints. Two corollary of these theorems, in the case where the upper and lower level objectives and constraints functions are convex are presented.

Higher-order Optimality Conditions for Henig Effcient Solution in Set-valued Optimization under Cone-convexlike Maps

This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.

The Optimality Conditions for Multiobjective Semi-infinite Programming Involving Generalized Unified （C, α, p, d）-convexity

The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.