Logarithmic-exponential penalty formulation for integer programming

DOI10.1016/S0893-9659(99)00104-4MaRDI QIDQ1961727zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 30 January 2000

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(99)00104-4

zbMATH Keywords

inequality constraintsinteger programminglogarithmic-exponential penalty functionnonlinear integer programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Nonlinear programming (90C30)

Recommendations

• Exact penalty function and asymptotic strong nonlinear duality in integer programming
• An exact penalty function approach for nonlinear integer programming problems
• Exact penalty functions for nonlinear integer programming problems
• General exact penalty functions in integer programming
• Penalty for zero–one integer equivalent problem

Cites work

• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• A Survey of Methods for Pure Nonlinear Integer Programming
• An exact penalty function approach for nonlinear integer programming problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming

Cited in

(2)

• Generalized nonlinear Lagrangian formulation for bounded integer programming
• General exact penalty functions in integer programming

This page was built for publication: Logarithmic-exponential penalty formulation for integer programming

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