A Boolean penalty method for zero-one nonlinear programming

DOI10.1023/A:1008329405026zbMath1028.90029OpenAlexW1600369703MaRDI QIDQ1583688

David Mauricio, Nelson F. Maculan

Publication date: 27 January 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008329405026

zbMATH Keywords

combinatorial optimization\(0-1\) constrained nonlinear programmingdiscrete penalty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (7)

A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ Exactness and algorithm of an objective penalty function ⋮ An objective penalty method for optimistic bilevel programming problems ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ Augmented Lagrangian Objective Penalty Function ⋮ An objective penalty function method for biconvex programming

This page was built for publication: A Boolean penalty method for zero-one nonlinear programming