mip_capable

A <a href="/link/?package=CVXR&version=1.0" reductionsolver'="" data-mini-rdoc="CVXR::"></a>'>ReductionSolver object.

solver

Determine if a solver is capable of solving a mixed-integer program (MIP).

An object-oriented modeling language for disciplined convex
programming (DCP). It allows the user to formulate convex optimization problems
in a natural way following mathematical convention and DCP rules. The system
analyzes the problem, verifies its convexity, converts it into a canonical form,
and hands it off to an appropriate solver to obtain the solution.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

David W Kang

Steven Diamond

John Miller

Stephen Boyd

Paul Kunsberg Rosenfield

mip_capable function

A <a href='<a href='ReductionSolver'></a>'>ReductionSolver</a> object.

mip_capable: Solver Capabilities

Description

Usage

Arguments

Value

Examples