The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
According to the need of industrial and agricultural production and living, we introduce “scatter sequence” of a regular triangle and build an optimization design model to maximize the minimum scatter numbers. Based on LINGO software, we obtain the solution of the minimum scatter numbers and their coordinates in some “scatter sequences” of the regular triangles with different numbers of points and...
Automatic code generation is the study of generative programming in the sense that the source code is generated automatically. In this paper, an approach based on component techniques that can produce in a systematic way correct, compatible and efficient database structures and manipulation function modules from abstract models is proposed. In contrast to some conventional software engineering methods,...
In this paper, a nonlinear programming problem is considered where the functions involved are η-semi-differentiable. An equivalent η-approximated vector optimization problem is constructed by a modification of the objective and the constraint functions in the original multi-objective programming problem. The connection between (weak) efficient points in the original multi-objective programming problem...
In this paper, we introduced a new class of generalized invex functions, called second order (F,α)-V-type function. And prove weak, strong, and strict converse duality theorems for Wolfe and Mond-Weir type vector optimization dual programs.
By using Mordukhovich's Subdifferential in Asplund Spaces, we obtain sufficiency conditions and duality for vector optimization problem with inequalities and equalities constraints. We extend the concept of type I, quasi type I and pseudo type I invex functions defined on Asplund spaces.
In this paper, we introduce the classes generalized KT-invexity and derive various sufficient optimality conditions for vector variational control problems under generalized KT-invexity assumptions.
In this paper, the saddle point optimality conditions and Lagrange dual problems of vector optimization for nearly convex function are studied. The optimality conditions of Fritz John and Kuhn-Tucker saddle points and their relations to the efficient solutions and weak efficient solutions are presented.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.