[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [Taler] optimal coin spending

**From**: |
Jeff Burdges |

**Subject**: |
Re: [Taler] optimal coin spending |

**Date**: |
Fri, 18 Dec 2015 15:58:59 +0100 |

On Fri, 2015-12-18 at 14:26 +0100, Jeff Burdges wrote:
>* 4. Linear programming*
>* *
>* In the linear programming case, we know any acceptable solution must*
>* occur along the "value plane" face given by*
>* sum_x v*(d-p) = price - price1*
>* with *
>* p = 0 or 1 for all x*
>* sum_x p = 0 or 1*
>* *
Oops, I wrote garbage in this section, probably due to rushing out the
door. If you tried to do it correctly, then you'd just reinvent the
simplex method.

**
**`signature.asc`

*Description:* This is a digitally signed message part

**[Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/18`
**Re: [Taler] optimal coin spending**,
*Jeff Burdges* **<=**
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/18`
**Re: [Taler] optimal coin spending**, *Christian Grothoff*, `2015/12/19`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/19`
**Re: [Taler] optimal coin spending**, *Christian Grothoff*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Christian Grothoff*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/20`

**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/19`