Ask Your Question

convex objective function with linear constraint

asked 2011-10-05 21:46:01 +0200

this post is marked as community wiki

This post is a wiki. Anyone with karma >750 is welcome to improve it.

for a no convex objective function with linear constraint, a lagrangian relaxation should work?

edit retag flag offensive close merge delete



This question is fairly vague, which is presumably why someone downvoted it. Can you give a more explicit formulation of your question? For instance, are you asking how to find "Lagrangian relaxations" in Sage?

kcrisman gravatar imagekcrisman ( 2011-10-06 17:25:33 +0200 )edit

1 Answer

Sort by ยป oldest newest most voted

answered 2014-07-03 03:41:37 +0200

Gregory Bard gravatar image

if f(x1,x2,..,xn) is convex (or concave) then minimizing or maximizing subject to the linear constraint g(x1,x2,..,xn)=0 should be the same as minimizing or maximizing

F(x1,x2,...,xn,L) = f(x1,x2,...xn) + L*g(x1,x2,...,xn)

in the unconstrained sense. See "minimize?" for help. Convex functions (or concave) functions will have a unique minimum (or unique maximum), so everything should work out.

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools


Asked: 2011-10-05 21:46:01 +0200

Seen: 292 times

Last updated: Jul 03 '14