In this paper, we study the nonlinear nonconvex with equality constraints and inequality constraints programming problems, under the condition that the feasible set is bounded and connected, and has a regular boundary...
详细信息
Today's industrial environment requires engineering design to be achieved by geographically distributed engineering teams who may work on different computer platforms, so the analogy can be presented as the distri...
详细信息
Today's industrial environment requires engineering design to be achieved by geographically distributed engineering teams who may work on different computer platforms, so the analogy can be presented as the distributed constraint optimization problems. This paper presents an agile approach that carries out a concurrent optimization of a product design and its associate constraint satisfaction in manufacturing perspective. Also, the approach has been implemented through the World Wide Web (WWW) regardless of the geographical constraints and different platforms used. In this paper, the hybrid evolution computation (EC) approaches combing genetic algorithm and stochastic annealing algorithms are applied to find optimal or near optimal solutions for two engineering design cases. The main contribution of this paper is to provide an agile approach for solving the engineering design problem which is modeled by the nonlinear programming model, and the approach is implemented through the WWW regardless of the geographical constraints and different platforms used. Experimental results are presented to exhibit the superior performance of the proposed methodology.
A new class of generalized V-type I invex functions is introduced for nonsmooth multiobjective programming problem. Based upon these generalized invex functions, we establish sufficient optimality conditions for a fea...
详细信息
A new class of generalized V-type I invex functions is introduced for nonsmooth multiobjective programming problem. Based upon these generalized invex functions, we establish sufficient optimality conditions for a feasible point to be an efficient or a weakly efficient solution. Weak, strong, and strict converse duality theorems are proved for Mond-Weir type dual program in order to relate the weakly efficient solutions of primal and dual programs.
Advancements have been made towards inclusion of both static and dynamic security into transfer capability calculation. However, to the authors' knowledge, work on considering corrective controls into the calculat...
详细信息
We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly) efficient solutions are presented. We formulate...
详细信息
We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly) efficient solutions are presented. We formulate Mond-Weir-type and Wolfe-type dual problems and establish weak and strong duality theorems for efficient solutions by using suitable generalized convexity conditions. Some special cases of our duality results are given.
Many real life problems can be modeled as nonlinear global optimization problems. Such problems often have multiple local minima and thus require global optimization methods. One of the more recent global optimiza...
详细信息
Many real life problems can be modeled as nonlinear global optimization problems. Such problems often have multiple local minima and thus require global optimization methods. One of the more recent global optimization tools is known as the filled function method which is a promising way used in unconstrained global optimization. Several filled functions with one or two parameters have already been suggested in the literatures. A new parameter-free filled function different from An [2004, Journal of Shanghai University] is proposed in this paper. The algorithm and numerical results of test functions are reported for comparison.
This paper presents a optimization algorithm to improve the positioning accuracy of the nodes in wireless sensor networks,and introduces RSSI-based(Received Signal Strength Indicator) wireless location technology on f...
详细信息
This paper presents a optimization algorithm to improve the positioning accuracy of the nodes in wireless sensor networks,and introduces RSSI-based(Received Signal Strength Indicator) wireless location technology on formation of multiple mobile ***,the RSSI value,which is measured between mobile node and reference node,is optimized by Gaussian *** the same time,using the classical method to calculate the positioning coordinates of each mobile node with the optimized RSSI ***,the position information and the RSSI values between each two mobile nodes are introduced to assist localization.A new optimization algorithm is proposed in this ***,the location problem is transformed into a nonlinear optimization *** experimental results showed that this method can improve the positioning accuracy of mobile nodes and implements the goal to estimate the positions of all nodes at one *** provides a basis for the study on positioning of dynamic network and multi-robot formation control.
Interior point method (IPM), as one of the most effecient methods, is being extended to solve different types of optimization problems in electric power domain. In this paper, the nonlinear OPF problem, formulated wit...
详细信息
ISBN:
(纸本)9781424465491
Interior point method (IPM), as one of the most effecient methods, is being extended to solve different types of optimization problems in electric power domain. In this paper, the nonlinear OPF problem, formulated with a rectangular coordinate form, is solved using the enhanced multiple predictor-corrector interior point method, which is combined with the selection of the optimal composite direction. An two stage linesearch strategy is also employed to obtain an optimal composite direction to improve the convergence property of MPC. The proposed method is then simulated for several test system ranging in size from 57 buses to 2790 buses. Numerical results demonstrate that the proposed method can lead to convergence with a smaller number of iterations and better computational time. Moreover, the comparison with different methods shows that the proposed method can be faster and robuster than that traditonal predictor-corrector interior point method and its variant.
Order arrangement is always the headache thing for manufacturers even in this high-tech modern ***,this paper manages to construct a nonlinear 0-1 programming mathematical model in search of optimal solution of minimi...
详细信息
Order arrangement is always the headache thing for manufacturers even in this high-tech modern ***,this paper manages to construct a nonlinear 0-1 programming mathematical model in search of optimal solution of minimizing the cost of *** we make an attempt to apply Genetic Algorithm in accordance with this NP-hard *** designing the algorithm,we propose an encoding method based both on orders and working procedure,adopt Roulette Wheel method to select the next generation,and embed crossover and mutation to avoid the common defect of premature *** that firms would have various psychological preferences towards different orders,we introduce Membership Function to characterize the priority of orders by comprehensively concern processing complexity,urgency and revenue of orders.
In this paper, we study the following nonlinear nonconvex programming problem: {minf(x)/ε.t.g.(x)≤0,i∈M,M={1.2,...,M}. Under the condition that the feasible set is bounded and connected, but it has a point that t...
详细信息
In this paper, we study the following nonlinear nonconvex programming problem: {minf(x)/ε.t.g.(x)≤0,i∈M,M={1.2,...,M}. Under the condition that the feasible set is bounded and connected, but it has a point that the boundary is not regular at this point, we propose the combined homotopy method to solve this problem by constructing a new constraint function and a combined homotopy equation. The convergence of the method is proved and the existence of a smooth homotopy path from any interior point to a solution of the problem is *** method is very different from previous homotopy method. Numerical examples show that this method is feasible and effective.
暂无评论