
Applied Math Applied Math Forum 
 LinkBack  Thread Tools  Display Modes 
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}+3xy3y^{2} 10x10y, subject to 2x^{2}+3xy10x >= 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 nonbinding. But what if we changed the constraint to 2x^{2}+3xy10x \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 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
constraint problem  helloprajna  Economics  0  February 18th, 2013 12:04 AM 
Help with budget constraint and utility maximisation  palarce  Economics  0  May 7th, 2012 06:59 AM 
least absolute error minimization with quadratic constraint  benoit  Linear Algebra  0  December 1st, 2010 03:34 AM 
Derivative with a range constraint  Gekko  Calculus  3  June 12th, 2010 10:16 AM 
Optimization of a Matrix with one constraint.  shack  Linear Algebra  3  December 17th, 2007 02:11 PM 