is_dgp: DGP Compliance

In CVXR: Disciplined Convex Optimization

DGP Compliance

Description

Determine if a problem or expression complies with the disciplined geometric programming rules.

Usage

is_dgp(object)

Arguments

object

A Problem or Expression object.

Value

A logical value indicating whether the problem or expression is DCP compliant, i.e. no unknown curvatures.

Examples

x <- Variable(pos = TRUE)
y <- Variable(pos = TRUE)
prob <- Problem(Minimize(x*y), list(x >= 5, y >= 5))
is_dgp(prob)
solve(prob, gp = TRUE)

CVXR documentation built on June 27, 2024, 5:11 p.m.