A Generalized Time Iteration Method for Solving Dynamic Optimization Problems with Occasionally Binding Constraints | Zendy

AI Assistant Blog Pricing

Open Access

A Generalized Time Iteration Method for Solving Dynamic Optimization Problems with Occasionally Binding Constraints

Author(s) -

Ayşe Kabukçuoğlu,

Enrique MartínezGarcía

Publication year - 2020

Language(s) - English

DOI - 10.24149/gwp396

Subject(s) - benchmark (surveying) , mathematical optimization , simple (philosophy) , computer science , optimization problem , investment (military) , mathematics , philosophy , geodesy , epistemology , politics , political science , law , geography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.