Abstract
Consider the following version (C ≥) of problem (C): (C ≥)
subject to
where c j (x j ) are twice differentiable convex functions of the same form, defined on the open convex sets X j in R, j ∈ J, respectively, d j > 0, J ≝ {1,..., n}.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stefanov, S.M. (2001). Version Two: Linear Constraint of the Form “≥”. In: Separable Programming. Applied Optimization, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3417-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3417-1_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4851-9
Online ISBN: 978-1-4757-3417-1
eBook Packages: Springer Book Archive