On the mixed integer signomial programming problems

DOI10.1016/j.amc.2005.01.034zbMath1088.90039OpenAlexW2127505767MaRDI QIDQ2573603

Ching-Ter Chang

Publication date: 22 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.034

zbMATH Keywords

Piecewise linear functionLinearization techniqueSignomial programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

A continuous strategy to solve a class of mixed optimization problems ⋮ Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• An approximately global optimization method for assortment problems
• An efficient linearization approach for mixed-integer problems
• On the posynomial fractional programming problems
• Stochastic global optimization methods part I: Clustering methods

This page was built for publication: On the mixed integer signomial programming problems