# Can min{<a,r> | r in P} be computed?

Let P be a polytope. The paper I'm reading uses the notation

```
<a, P> = min{<a,r> | r in P}
```

Can this value be computed in sage?

Can min{<a,r> | r in P} be computed?

Let P be a polytope. The paper I'm reading uses the notation

```
<a, P> = min{<a,r> | r in P}
```

Can this value be computed in sage?

add a comment

1

`.to_linear_program()`

to make a linear program out of it (you will then have to set an objective corresponding to `r`

).

Asked: **
2016-09-19 17:50:35 -0500
**

Seen: **23 times**

Last updated: **Sep 19 '16**

What is the most efficient way to "look up" a face in the face lattice of a polyhedron?

Visualizing Polyhedron with specified range

force 0/1 in V-representation of a set of inequalities

Can sage compute the Minkowski sum of two cones?

Getting convex hull of a set of points and plotting the polygon

Can sage compute the face decomposition of a minkowski sum?

Parallelizing Polyhedral volume computation

generating an array of convex polyhedrons

How to compute the convex hull of a set of points in the plane?

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.