Example: quiz answers
The CVX Users’ Guide
constrained to take on integral values. In other words, if the integer constraints are removed, the result is a standard DCP. Unlike a true DCP, a mixed integer problem is not convex. Finding the global optimum requires the combi-nation of a traditional convex optimization algorithm with an exhaustive search such as a branch-and-bound algorithm.
Download The CVX Users’ Guide
Information
Domain:
Source:
Link to this page: