Abstract
This article is concerned with quadratic fractional optimal control problems with linear state constraints. Such problems are called the {\em continuous-time quadratic fractional programming problems} (CQFP). Some basic properties of parametric continuous-time quadratic programming problems pertaining to (CQFP) are derived. By these properties, (CQFP) can be reduced to continuous-time quadratic programming problems. Besides, a discretization approach for solving continuous-time quadratic programming problems is also developed. The developed approach will provide an important foundation for constructing a parametric computational procedure for (CQFP).
Sign-in/Register to access full text options 
Free) 
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 call
