On boundedness of (quasi-)convex integer optimization problems

DOI10.1007/s00186-007-0196-3zbMath1171.90005OpenAlexW1984696651MaRDI QIDQ999128

Wiesława T. Obuchowska

Publication date: 30 January 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0196-3

zbMATH Keywords

nonlinear integer programmingboundednessexistence of optimal solutions

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

Unboundedness in reverse convex and concave integer programming ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Minimal infeasible constraint sets in convex integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the analytic centers of convex sets
• Conditions for boundedness in concave programming under reverse convex and convex constraints
• On extensions of the Frank-Wolfe theorems
• Convex constrained programmes with unattained infima
• How to deal with the unbounded in optimization: Theory and algorithms
• A Frank--Wolfe type theorem for convex polynomial programs
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes

This page was built for publication: On boundedness of (quasi-)convex integer optimization problems