An approximate method for local optima for nonlinear mixed integer programming problems

DOI10.1016/0305-0548(92)90072-DzbMath0767.90055MaRDI QIDQ1200840

Han-Lin Li

Publication date: 16 January 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

modified penalty function method

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A global approach for general \(0-1\) fractional programming ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ An optimal control approach to nonlinear mixed integer programming problems ⋮ A linearization method for mixed 0--1 polynomial programs ⋮ An approximate approach of global optimization for polynomial programming problems ⋮ A new global approach for \(0\)-\(1\) polynomial programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• An Automatic Method of Solving Discrete Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• A tree-search algorithm for mixed integer programming problems
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• A Balasian-Based Algorithm for Zero-One Polynomial Programming