An exact penalty function method for nonlinear mixed discrete programming problems

DOI10.1007/s11590-011-0391-2zbMath1261.90031OpenAlexW2060646159MaRDI QIDQ1936789

Yan-Qin Bai, Kok Lay Teo, Chang Jun Yu

Publication date: 7 February 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0391-2

zbMATH Keywords

nonlinear mixed integer programmingexact penalty function

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (8)

Optimal discrete-valued control computation ⋮ ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization ⋮ Translation, solving scheme, and implementation of a periodic and optimal impulsive state control problem ⋮ Optimal control of impulsive switched systems with minimum subsystem durations ⋮ A computational algorithm for a class of non-smooth optimal control problems arising in aquaculture operations ⋮ Dynamic optimization of dual-mode hybrid systems with state-dependent switching conditions ⋮ Optimal switching for linear quadratic problem of switched systems in discrete time ⋮ Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• A new exact penalty function method for continuous inequality constrained optimization problems
• An algorithm for nonlinear optimization problems with binary variables
• Optimization and control of bilinear systems. Theory, algorithms, and applications
• Exact penalty functions for nonlinear integer programming problems
• Solutions to quadratic minimization problems with box and integer constraints
• Canonical dual approach to solving 0-1 quadratic programming problems
• Constrained global optimization: algorithms and applications
• Duality principles in nonconvex systems. Theory, methods and applications
• Discrete filled function method for discrete global optimization
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
• On implementation of computational algorithms for optimal design 1: Preliminary investigation
• A Computational Study of Search Strategies for Mixed Integer Programming

This page was built for publication: An exact penalty function method for nonlinear mixed discrete programming problems