Abstract
We characterize solutions to the problem of minimizing a convex integral objective function subject to a finite number of linear constraints and requiring that the feasible functions lie in a strip [α,β] where α and β are extended real valued measurable functions. We use the duality theory of J. M. Borwein and A. S. Lewis ( Math. Programming, Series B 57 (1992), 15-48, 49-84) to show that the solutions are of the usual form, but truncated where they leave the strip.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
