# 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: **24 times**

Last updated: **Sep 19 '16**

Can the base ring of a polyhedron be restricted?

Can I intersect the boundaries of two polyhedra and display it?

generating an array of convex polyhedrons

Visualizing Polyhedron with specified range

find one interior point of a polyhedron

projection_direction broken for polytopes?

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.