Re: Constrained Optimization
- To: mathgroup at smc.vnet.net
- Subject: [mg57762] Re: Constrained Optimization
- From: Caspar von Seckendorff <seckendorff at alphatec.de>
- Date: Tue, 7 Jun 2005 05:59:50 -0400 (EDT)
- References: <d7mj30$bqm$1@smc.vnet.net> <d7pb7q$t80$1@smc.vnet.net> <d7rk7r$blu$1@smc.vnet.net> <d812pv$cog$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Paul Abbott schrieb: > KuhnTucker[obj_, cons_List, vars_, domain___] := ... > > In some cases, this approach can solve problems which cannot directly be > solved with Maximize and Minimize. However, it does not appear to help > for your example ... That's great. Actually it seems to work: In[]:= KuhnTucker[-(x - x^2) y, {1/5 <= x, x <= 2/5, y > 0}, {x}, Reals] Out[]:= y > 0 && x == 2/5 && m[1] == 0 && m[2] == y/5 Thanks also for pointing out how to use ForAll[...] to get the upper bound (Maxim) and the maximizing x (Andrzej Kozlowski). Being new to Mathematica, I have not worked with this function before, but it seems that you can do a lot with it... Greetings, -Caspar
- Follow-Ups:
- Re: Re: Constrained Optimization
- From: Andrzej Kozlowski <andrzej@akikoz.net>
- Re: Re: Constrained Optimization