An optimization method for solving mixed discrete-continuous programming problems

DOI10.1016/j.camwa.2007.01.006zbMath1152.90543OpenAlexW1974159704MaRDI QIDQ2519622

Vijaya K. Srivastava, Atef Fahim

Publication date: 27 January 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.006

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A bacterial gene recombination algorithm for solving constrained optimization problems ⋮ A novel modified differential evolution algorithm for constrained optimization problems

Uses Software

• GAMS
• MacMINLP

Cites Work

• Unnamed Item
• Unnamed Item
• Solving mixed integer nonlinear programs by outer approximation
• A two-phase optimization procedure for integer programming problems
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Generalized Benders decomposition
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Nonlinear Programming with the Aid of a Multiple-Gradient Summation Technique

This page was built for publication: An optimization method for solving mixed discrete-continuous programming problems