Applied Math Applied Math Forum

 December 8th, 2009, 03:40 AM #1 Newbie   Joined: Dec 2009 Posts: 1 Thanks: 0 Optimization Problem with Constraint I have a (maybe trivial?) question on constrained optimization. Assume that I have the following maximization problem: \max_{x,y} -2x^{2}+3xy-3y^{2} -10x-10y, subject to -2x^{2}+3xy-10x >= 0. I setup the Lagrangian and I get the following first order conditions with the lagrange multiplier \lambda. -4x + 3y - 10 + \lambda (-4x + 3y -10) = 0, 3x -6y - 10 + \lambda (3x) = 0. By the Kuhn Tucker conditions, we know that if \lambda > 0, then the constraint is binding. However, from the first order conditions, we can see that the multiplier \lambda is negative! How can this be? Am I doing things wrong here? I know that this could mean that the constraint is always non-binding. But what if we changed the constraint to -2x^{2}+3xy-10x \geq 100. This clearly has an effect on the problem. So does this mean that the regularity condition (constraint qualification) is violated? Please help! Thank you Tags constraint, optimization, problem ### what is first order condition in economics

Click on a term to search for related topics.
 Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post helloprajna Economics 0 February 18th, 2013 12:04 AM palarce Economics 0 May 7th, 2012 06:59 AM benoit Linear Algebra 0 December 1st, 2010 03:34 AM Gekko Calculus 3 June 12th, 2010 10:16 AM shack Linear Algebra 3 December 17th, 2007 02:11 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top      