Disciplined Convex Programming

* Final gross prices may vary according to local VAT.

Get Access

Summary

A new methodology for constructing convex optimization models called disciplined convex programming is introduced. The methodology enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.