A filled function method for box constrained nonlinear integer programming

DOI10.4134/JKMS.2011.48.5.985MaRDI QIDQ3170433zbMATH OpenOpenAlexFDO

Authors Youjiang Lin, Yongjian Yang

Publication date 27 September 2011

Published in Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/jkms.2011.48.5.985

zbMATH Keywords

global optimizationfilled function methodglobal minimizerlocal minimizernonlinear integer programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Integer programming (90C10)

Recommendations

• A filled function method for constrained nonlinear integer programming
• A filled function method for constrained global integer optimization
• A new filled function method for nonlinear integer programming problem
• A convex filled function method for nonlinear integer programming
• scientific article; zbMATH DE number 1558263

Cited in

(9)

• A novel filled function method for nonlinear equations
• A filled function method for constrained nonlinear integer programming
• A class of parameter-free filled functions for box-constrained system of nonlinear equations
• A discrete dynamic convexized method for nonlinear integer programming
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• Non parameter-filled function for global optimization
• A filled function method for constrained global integer optimization
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
• Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials

This page was built for publication: A filled function method for box constrained nonlinear integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170433)