First Page | Document Content | |
---|---|---|
![]() Date: 2014-10-28 09:53:55Mathematical analysis Convex optimization Linear programming Convex analysis Karush–Kuhn–Tucker conditions Gradient method Duality Strong duality Optimal design Mathematical optimization Numerical analysis Operations research | Source URL: www.siam.orgDownload Document from Source WebsiteFile Size: 60,63 KBShare Document on Facebook |
![]() | Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 NewDocID: 1xVFF - View Document |
![]() | Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPsDocID: 1xUZo - View Document |
![]() | Mixed-Integer Linear Programming LP Branch-and-Bound SearchDocID: 1voVH - View Document |
![]() | DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew GalatiDocID: 1vkrh - View Document |
![]() | Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. CherDocID: 1vcNT - View Document |