A Maximum Volume Ellipsoid Finder软件

This code finds the largest ellipsoid inscribing a polytope Ax 软件应用简介

The Maximum Volume Ellipsoid Problem is to find the largest ellipsoid (measured by volume) inscribing a given polytope defined by a finite number of linear inequalities; that is, Ax <= b, where A is an m by n matrix with m > n and b is an m-vector. 

By definition, a polytope is a bounded polyhedron. For the problem to have a meaningful solution, the polytope must be full dimensional (i.e., it must have a non-zero volume).

界面展示

结果示意

规格 价