Global optimality conditions for some classes of polynomial integer programming problems

DOI10.3934/jimo.2011.7.67zbMath1214.90089OpenAlexW2327977305MaRDI QIDQ542571

Jing Quan, Guoquan Li, Zhi-You Wu

Publication date: 10 June 2011

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.67

zbMATH Keywords

abstract convexityglobal optimality conditionspolynomial integer programming problem

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Real polynomials: analytic properties, etc. (26C05)

Related Items (2)

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ A global optimal zero-forcing beamformer design with signed power-of-two coefficients

This page was built for publication: Global optimality conditions for some classes of polynomial integer programming problems