Abstract
A certain class of discrete optimization problems is investigated using the framework of nonlinear programming. It is shown that a discrete maximum principle similar to the Pontryagin maximum principle is valid for a subclass of these problems, specifically systems with linear dynamics, convex inequality constraints and convex performance criteria. This result extends the applicability of the discrete maximum principle to a class of problems not covered by the Rozonoer-Halkin formulation.
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.
