Difference-genetic co-evolutionary algorithm for nonlinear mixed integer programming problems
نویسندگان
چکیده
منابع مشابه
Sufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملA Genetic Algorithm for Mixed Integer Nonlinear Programming Problems Using Separate Constraint Approximations
This paper describes a new approach for reducing the number of the fitness and constraint function evaluations required by a genetic algorithm (GA) for optimization problems with mixed continuous and discrete design variables. The proposed additions to the GA make the search more effective and rapidly improve the fitness value from generation to generation. The additions involve memory as a fun...
متن کاملOverview on Mixed Integer Nonlinear Programming Problems
Many optimization problems involve integer and continuous variables that can be modeled as mixed integer nonlinear programming (MINLP) problems. This has led to a wide range of applications, in particular in some engineering areas. Here, we provide a brief overview on MINLP, and present a simple idea for a future nonconvex MINLP solution technique.
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Sciences and Applications
سال: 2016
ISSN: 2008-1901
DOI: 10.22436/jnsa.009.03.51