In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered...In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered in order to derive the necessary and sufficient optimality conditions.Furthermore,we formulate a mixed-type dual problem and derive duality results which associate the robust weak efficient solution of the primal and its dual problems.Several examples are given to illustrate the results in the manuscript.展开更多
This paper is devoted to the study of KKT-type optimality via the generalized subdifferentials of a nonsmooth vector equilibrium problem with set, inequality and equality constraints(CVEP, for brevity) and its applica...This paper is devoted to the study of KKT-type optimality via the generalized subdifferentials of a nonsmooth vector equilibrium problem with set, inequality and equality constraints(CVEP, for brevity) and its applications. First, we provide the notion of the generalized subdifferentials associated to the contingent epiderivatives(also called the Aubin-Frankowska's generalized subdifferentials) and the Clarke's generalized subgradients. Additionally, we provide some regularity conditions(RC1) and(RC3-s) for any index s ∈ I = {1, ..., p}. Some KKT-type necessary optimality conditions for the efficient solution types of problem CVEP under some suitable regularity conditions are derived. Besides, some strong KKT-type necessary optimality conditions become sufficient optimality conditions under some suitable assumptions on the pseudoconvexity, quasiconvexity and quasilinearly of objective and constraint functions. Finally, an application of such result to the vector optimization problem with constraints(CVOP) and the vector variational inequality problem with constraints(CVVI) is presented. Some illustrative examples are also provided for our findings.展开更多
Under the theory structure of compressive sensing (CS), an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution (BOR), which will ...Under the theory structure of compressive sensing (CS), an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution (BOR), which will result in a small-scale impedance matrix. In the new linear equation system, the small-scale impedance matrix can be regarded as the measurement matrix in CS, while the excited vector is the measurement of unknown currents. Instead of solving dense full rank matrix equations by the iterative method, with suitable sparse representation, for unknown currents on the surface of BOR, the entire current can be accurately obtained by reconstructed algorithms in CS for small-scale undetermined equations. Numerical results show that the proposed method can greatly improve the computgtional efficiency and can decrease memory consumed.展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. U...Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.展开更多
The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary con...The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
The aim of this article is to present new existence results for globally efficient solutions of a strong vector equilibrium problem given by a sum of two functions via a generalized KKM principle, and to establish the...The aim of this article is to present new existence results for globally efficient solutions of a strong vector equilibrium problem given by a sum of two functions via a generalized KKM principle, and to establish the connectedness of the solutions set.展开更多
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 ...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.展开更多
Poisson's equation is solved numerically by two direct methods, viz. Block Cyclic Reduction (BCR) method and Fourier Method. Qualitative and quantitative comparison between the numerical solutions obtained by two ...Poisson's equation is solved numerically by two direct methods, viz. Block Cyclic Reduction (BCR) method and Fourier Method. Qualitative and quantitative comparison between the numerical solutions obtained by two methods indicates that BCR method is superior to Fourier method in terms of speed and accuracy. Therefore. BCR method is applied to solve (?)2(?)= ζ and (?)2X= D from observed vorticity and divergent values. Thereafter the rotational and divergent components of the horizontal monsoon wind in the lower troposphere are reconstructed and are com pared with the results obtained by Successive Over-Relaxation (SOR) method as this indirect method is generally in more use for obtaining the streamfunction ((?)) and velocity potential (X) fields in NWP models. It is found that the results of BCR method are more reliable than SOR method.展开更多
Broadband vibration attenuation is a challenging task in engineering since it is difficult to achieve low-frequency and broadband vibration control simultaneously.To solve this problem,this paper designs a piezoelectr...Broadband vibration attenuation is a challenging task in engineering since it is difficult to achieve low-frequency and broadband vibration control simultaneously.To solve this problem,this paper designs a piezoelectric meta-beam with unidirectional electric circuits,exhibiting promising broadband attenuation capabilities.An analytical model in a closed form for achieving the solution of unidirectional vibration transmission of the designed meta-beam is developed based on the state-space transfer function method.The method can analyze the forward and backward vibration transmission of the piezoelectric meta-beam in a unified manner,providing reliable dynamics solutions of the beam.The analytical results indicate that the meta-beam effectively reduces the unidirectional vibration across a broad low-frequency range,which is also verified by the solutions obtained from finite element analyses.The designed meta-beam and the proposed analytical method facilitate a comprehensive investigation into the distinctive unidirectional transmission behavior and superb broadband vibration attenuation performance.展开更多
Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to t...Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to the concatenation of a lattice matrix with the sum of some random matrices, and the signature vector is generated by using the Preimage Sampling algorithm. Compared with current attribute-based signature schemes, this scheme can resist quantum attacks and enjoy shorter public-key, smaller signature size and higher efficiency.展开更多
In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland's theorem related to set-valued vector equilibrium problems. As applications, we der...In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland's theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.展开更多
BACKGROUND:The study aims to investigate an optimal indicator for changing the filter during the continuous renal replacement therapy(CRRT)in intensive care unit(ICU)patients with acute kidney injury(AKI).METHODS:Pati...BACKGROUND:The study aims to investigate an optimal indicator for changing the filter during the continuous renal replacement therapy(CRRT)in intensive care unit(ICU)patients with acute kidney injury(AKI).METHODS:Patients with AKI requiring CRRT in an ICU were randomly divided into two groups for crossover trial,i.e.,groups A and B.Patients in the group A were firstly treated with continuous veno-venous hemofiltration(CVVH),followed by continuous veno-venous hemodiafiltration(CVVHDF).Patients in the group B were firstly treated with CVVHDF followed by CVVH.Delivered doses of solutes with different molecular weights at the indicated time points between groups were compared.A correlation analysis between the delivered dose and pre-filter pressure(PPRE)and transmembrane pressure(PTM)was performed.Receiver operating characteristic(ROC)curves were constructed to evaluate the accuracy of PTM as an indicator for filter replacement.RESULTS:A total of 50 cases were analyzed,27 in the group A and 23 in the group B.Delivered doses of different molecular-weight solutes significantly decreased before changing the filter in both modalities,compared with those at the initiation of treatment(all P<0.05).In the late stage of CRRT,the possible rebound of serum medium-molecular-weight solute concentration was observed.PTM was negatively correlated with the delivered dose of medium-molecular-weight solute in both modalities.The threshold for predicting the rebound of serum concentration of medium-molecularweight solute by PTM was 146.5 mm Hg(1 mm Hg=0.133 k Pa).CONCLUSIONS:The filter can be used as long as possible within the manufacturer’s safe use time limits to remove small-molecular-weight solutes.PTM of 146.5 mm Hg may be an optimal indicator for changing the filter in CRRT therapies to remove medium-molecular-weight solutes.展开更多
To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programmi...To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John (G-F-J) and G-Karnsh-Kuhn-Tucker (G-K-K-T) types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.展开更多
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr...In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.展开更多
The time accuracy of the exponentially accurate Fourier time spectral method(TSM) is examined and compared with a conventional 2nd-order backward difference formula(BDF) method for periodic unsteady flows. In part...The time accuracy of the exponentially accurate Fourier time spectral method(TSM) is examined and compared with a conventional 2nd-order backward difference formula(BDF) method for periodic unsteady flows. In particular, detailed error analysis based on numerical computations is performed on the accuracy of resolving the local pressure coefficient and global integrated force coefficients for smooth subsonic and non-smooth transonic flows with moving shock waves on a pitching airfoil. For smooth subsonic flows, the Fourier TSM method offers a significant accuracy advantage over the BDF method for the prediction of both the local pressure coefficient and integrated force coefficients. For transonic flows where the motion of the discontinuous shock wave contributes significant higherorder harmonic contents to the local pressure fluctuations,a sufficient number of modes must be included before the Fourier TSM provides an advantage over the BDF method.The Fourier TSM, however, still offers better accuracy than the BDF method for integrated force coefficients even for transonic flows. A problem of non-symmetric solutions for symmetric periodic flows due to the use of odd numbers of intervals is uncovered and analyzed. A frequency-searching method is proposed for problems where the frequency is not known a priori. The method is tested on the vortex shedding problem of the flow over a circular cylinder.展开更多
In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is ...In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.展开更多
In this paper some optimality criteria are proved and some Mond-Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.
Duality framework on vector optimization problems in a locally convex topological vector space are established by using scalarization with a cone-strongly increasing function.The dualities for the scalar convex compos...Duality framework on vector optimization problems in a locally convex topological vector space are established by using scalarization with a cone-strongly increasing function.The dualities for the scalar convex composed optimization problems and for general vector optimization problems are studied.A general approach for studying duality in vector optimization problems is presented.展开更多
Many Optimization problems in engineering and economic involve the challenging task of pondering both conflicting goals and random data. In this paper, we give an up-to-date overview of how important ideas from optimi...Many Optimization problems in engineering and economic involve the challenging task of pondering both conflicting goals and random data. In this paper, we give an up-to-date overview of how important ideas from optimization, probability theory and multicriteria decision analysis are interwoven to address situations where the presence of several objective functions and the stochastic nature of data are under one roof in a linear optimization context. In this way users of these models are not bound to caricature their problems by arbitrarily squeezing different objective functions into one and by blindly accepting fixed values in lieu of imprecise ones.展开更多
基金supported by the MATRICES,SERB-DST,New Delhi,India(No.MTR/2021/000002).
摘要In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered in order to derive the necessary and sufficient optimality conditions.Furthermore,we formulate a mixed-type dual problem and derive duality results which associate the robust weak efficient solution of the primal and its dual problems.Several examples are given to illustrate the results in the manuscript.
摘要This paper is devoted to the study of KKT-type optimality via the generalized subdifferentials of a nonsmooth vector equilibrium problem with set, inequality and equality constraints(CVEP, for brevity) and its applications. First, we provide the notion of the generalized subdifferentials associated to the contingent epiderivatives(also called the Aubin-Frankowska's generalized subdifferentials) and the Clarke's generalized subgradients. Additionally, we provide some regularity conditions(RC1) and(RC3-s) for any index s ∈ I = {1, ..., p}. Some KKT-type necessary optimality conditions for the efficient solution types of problem CVEP under some suitable regularity conditions are derived. Besides, some strong KKT-type necessary optimality conditions become sufficient optimality conditions under some suitable assumptions on the pseudoconvexity, quasiconvexity and quasilinearly of objective and constraint functions. Finally, an application of such result to the vector optimization problem with constraints(CVOP) and the vector variational inequality problem with constraints(CVVI) is presented. Some illustrative examples are also provided for our findings.
基金Supported by the National Natural Science Foundation of China under Grant Nos 51477039 and 51207041the Program of Hefei Normal University under Grant Nos 2014136KJA04 and 2015TD01the Key Project of Provincial Natural Science Research of University of Anhui Province of China under Grant No KJ2015A174
摘要Under the theory structure of compressive sensing (CS), an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution (BOR), which will result in a small-scale impedance matrix. In the new linear equation system, the small-scale impedance matrix can be regarded as the measurement matrix in CS, while the excited vector is the measurement of unknown currents. Instead of solving dense full rank matrix equations by the iterative method, with suitable sparse representation, for unknown currents on the surface of BOR, the entire current can be accurately obtained by reconstructed algorithms in CS for small-scale undetermined equations. Numerical results show that the proposed method can greatly improve the computgtional efficiency and can decrease memory consumed.
摘要In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
摘要Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.
摘要The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
摘要The aim of this article is to present new existence results for globally efficient solutions of a strong vector equilibrium problem given by a sum of two functions via a generalized KKM principle, and to establish the connectedness of the solutions set.
基金Foundation item: Supported by the Natural Science Foundation of China(10871216) Supported by the Natural Science Foundation Project of CQ CSTC(2008BB0346, 2007BB0441) Supported by the Excellent Young Teachers Program of Chongqing Jiaotong University(EYT08-016) Acknowledgement The author would like to thank the anonymous referee for the valuable remarks that helped considerably to correct and to improve the presentation.
摘要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.
摘要Poisson's equation is solved numerically by two direct methods, viz. Block Cyclic Reduction (BCR) method and Fourier Method. Qualitative and quantitative comparison between the numerical solutions obtained by two methods indicates that BCR method is superior to Fourier method in terms of speed and accuracy. Therefore. BCR method is applied to solve (?)2(?)= ζ and (?)2X= D from observed vorticity and divergent values. Thereafter the rotational and divergent components of the horizontal monsoon wind in the lower troposphere are reconstructed and are com pared with the results obtained by Successive Over-Relaxation (SOR) method as this indirect method is generally in more use for obtaining the streamfunction ((?)) and velocity potential (X) fields in NWP models. It is found that the results of BCR method are more reliable than SOR method.
基金Project supported by the National Natural Science Foundation of China (Nos. U2141244, 11932011,12393781, 12121002, and 12202267)supported by the Oceanic Interdisciplinary Program of Shanghai Jiao Tong University(No.SL2021ZD104)+4 种基金the Science and Technology Cooperation Project of Shanghai Jiao Tong University&Inner Mongolia Autonomous Region-Action Plan of Shanghai Jiao Tong University for“Science and Technology Prosperity”(No.2022XYJG0001-01-08)the Industryuniversity-research Cooperation Fund of Shanghai Academy of Spaceflight Technology(No.USCAST2021-11)Shanghai Pujiang Program(No.22PJ1405300)Young Talent Reservoir of CSTAM(No.CSTAM2022-XSC-QN1)the Starting Grant of Shanghai Jiao Tong University(No.WH220402014).
摘要Broadband vibration attenuation is a challenging task in engineering since it is difficult to achieve low-frequency and broadband vibration control simultaneously.To solve this problem,this paper designs a piezoelectric meta-beam with unidirectional electric circuits,exhibiting promising broadband attenuation capabilities.An analytical model in a closed form for achieving the solution of unidirectional vibration transmission of the designed meta-beam is developed based on the state-space transfer function method.The method can analyze the forward and backward vibration transmission of the piezoelectric meta-beam in a unified manner,providing reliable dynamics solutions of the beam.The analytical results indicate that the meta-beam effectively reduces the unidirectional vibration across a broad low-frequency range,which is also verified by the solutions obtained from finite element analyses.The designed meta-beam and the proposed analytical method facilitate a comprehensive investigation into the distinctive unidirectional transmission behavior and superb broadband vibration attenuation performance.
基金Supported by the National Natural Science Foundation of China(61173151,61472309)
摘要Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to the concatenation of a lattice matrix with the sum of some random matrices, and the signature vector is generated by using the Preimage Sampling algorithm. Compared with current attribute-based signature schemes, this scheme can resist quantum attacks and enjoy shorter public-key, smaller signature size and higher efficiency.
基金supported by the National Natural Science Foundation of China (11061023)
摘要In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland's theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.
基金supported by Kunshan Science and Technology Special Fund(Social Development Category,KS18040)。
摘要BACKGROUND:The study aims to investigate an optimal indicator for changing the filter during the continuous renal replacement therapy(CRRT)in intensive care unit(ICU)patients with acute kidney injury(AKI).METHODS:Patients with AKI requiring CRRT in an ICU were randomly divided into two groups for crossover trial,i.e.,groups A and B.Patients in the group A were firstly treated with continuous veno-venous hemofiltration(CVVH),followed by continuous veno-venous hemodiafiltration(CVVHDF).Patients in the group B were firstly treated with CVVHDF followed by CVVH.Delivered doses of solutes with different molecular weights at the indicated time points between groups were compared.A correlation analysis between the delivered dose and pre-filter pressure(PPRE)and transmembrane pressure(PTM)was performed.Receiver operating characteristic(ROC)curves were constructed to evaluate the accuracy of PTM as an indicator for filter replacement.RESULTS:A total of 50 cases were analyzed,27 in the group A and 23 in the group B.Delivered doses of different molecular-weight solutes significantly decreased before changing the filter in both modalities,compared with those at the initiation of treatment(all P<0.05).In the late stage of CRRT,the possible rebound of serum medium-molecular-weight solute concentration was observed.PTM was negatively correlated with the delivered dose of medium-molecular-weight solute in both modalities.The threshold for predicting the rebound of serum concentration of medium-molecularweight solute by PTM was 146.5 mm Hg(1 mm Hg=0.133 k Pa).CONCLUSIONS:The filter can be used as long as possible within the manufacturer’s safe use time limits to remove small-molecular-weight solutes.PTM of 146.5 mm Hg may be an optimal indicator for changing the filter in CRRT therapies to remove medium-molecular-weight solutes.
基金National Natural Science Foundation of China(No.11071110)
摘要To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John (G-F-J) and G-Karnsh-Kuhn-Tucker (G-K-K-T) types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.
摘要In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.
基金supported by the State Scholarship Fund of the China Scholarship Council (Grant 2009629129)
摘要The time accuracy of the exponentially accurate Fourier time spectral method(TSM) is examined and compared with a conventional 2nd-order backward difference formula(BDF) method for periodic unsteady flows. In particular, detailed error analysis based on numerical computations is performed on the accuracy of resolving the local pressure coefficient and global integrated force coefficients for smooth subsonic and non-smooth transonic flows with moving shock waves on a pitching airfoil. For smooth subsonic flows, the Fourier TSM method offers a significant accuracy advantage over the BDF method for the prediction of both the local pressure coefficient and integrated force coefficients. For transonic flows where the motion of the discontinuous shock wave contributes significant higherorder harmonic contents to the local pressure fluctuations,a sufficient number of modes must be included before the Fourier TSM provides an advantage over the BDF method.The Fourier TSM, however, still offers better accuracy than the BDF method for integrated force coefficients even for transonic flows. A problem of non-symmetric solutions for symmetric periodic flows due to the use of odd numbers of intervals is uncovered and analyzed. A frequency-searching method is proposed for problems where the frequency is not known a priori. The method is tested on the vortex shedding problem of the flow over a circular cylinder.
摘要In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.
摘要In this paper some optimality criteria are proved and some Mond-Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.
基金Supported by the Natural Science Foundation of Fujian Province(S0650021)
摘要Duality framework on vector optimization problems in a locally convex topological vector space are established by using scalarization with a cone-strongly increasing function.The dualities for the scalar convex composed optimization problems and for general vector optimization problems are studied.A general approach for studying duality in vector optimization problems is presented.
摘要Many Optimization problems in engineering and economic involve the challenging task of pondering both conflicting goals and random data. In this paper, we give an up-to-date overview of how important ideas from optimization, probability theory and multicriteria decision analysis are interwoven to address situations where the presence of several objective functions and the stochastic nature of data are under one roof in a linear optimization context. In this way users of these models are not bound to caricature their problems by arbitrarily squeezing different objective functions into one and by blindly accepting fixed values in lieu of imprecise ones.