Global optimality conditions for some classes of polynomial integer programming problems

DOI10.3934/JIMO.2011.7.67MaRDI QIDQ542571zbMATH OpenOpenAlexFDO

Authors J. Quan, G. Q. Li, Zhiyou Wu

Publication date 10 June 2011

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

global optimality conditionsabstract convexitypolynomial integer programming problem

Mathematics Subject Classification ID

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

Recommendations

• Global optimality conditions for a class of polynomial integer programming problems with linear constraints
• Optimization methods for a class of integer polynomial programming problems
• Global optimality conditions and optimization methods for quadratic integer programming problems
• Global optimality conditions for mixed integer quadratic programming problems
• Necessary global optimality conditions for nonlinear programming problems

Cited in

(6)

• Some applications of a polynomial inequality to global optimization
• Optimality criterion for a class of nonlinear integer programs.
• Optimization methods for a class of integer polynomial programming problems
• Global optimality conditions for a class of polynomial integer programming problems with linear constraints
• 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

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