Login / Signup
Conditions for boundedness in concave programming under reverse convex and convex constraints.
Wieslawa T. Obuchowska
Published in:
Math. Methods Oper. Res. (2007)
Keyphrases
</>
convex constraints
sufficient conditions
convex optimization
convex functions
global consistency
convex programming
linear constraints
piecewise linear
primal dual
constraint networks
variable elimination
interior point methods
path consistency
objective function
np hard