[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: qp(): how do I get a simple inequality constraint?

**From**: |
fork |

**Subject**: |
Re: qp(): how do I get a simple inequality constraint? |

**Date**: |
Tue, 27 Sep 2011 22:09:28 +0000 (UTC) |

**User-agent**: |
Loom/3.14 (http://gmane.org/) |

Leo Butler <l.butler <at> cmich.edu> writes:
>* *
>* fork <forkandwait <at> gmail.com> writes:*
>
>* > Seems to me that "lb" and "ub" and "A_lb" can be all be set with the right*
>* > (possibly negative) entries in A_in and A_ub. Is that true?*
>* *
>* Yes. The cost is paid in the size of A_in and A_ub.*
Cool. Is there a substantial computational cost to only using A_in and A_ub?
I will probably never use lb and ub and A_lb. I know they are in there for ML
compatibility, but I think they are actually more confusing then helpful, unless
they provide a speedup.
>* I take it that your original question is resolved?*
Yes. I am not sure if my results will be useful, but it was definitely
interesting to learn how to use qp(), and I it would have been A LOT harder
without your help.