# 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`

).

Please start posting anonymously - your entry will be published after you log in or create a new account.

Asked: ** 2016-09-20 00:50:35 +0200 **

Seen: **60 times**

Last updated: **Sep 20 '16**

Compute the centroid of a polytope

generating an array of convex polyhedrons

Equalities/Inequalities in Polyhedron()

integrate rational function over a polyhedral domain

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

find one interior point of a polyhedron

combinatorial equivalence for Polyhedra / isomorphism for lattices

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.