Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Help solve a minimization problem using geometry only

Status
Not open for further replies.

claudiocamera

Full Member level 4
Joined
Aug 19, 2005
Messages
224
Helped
27
Reputation
54
Reaction score
6
Trophy points
1,298
Location
Salvador-BA-Brazil
Activity points
4,282
Given the minimization problem

min x²+y²
Subjec to 2x+y = c where c is a constant.
How to find grafficaly(geometricaly) the minimum point.
Applying the optimization theorems using gradient and hessian will we find x=2c/5 and y = c/5. But how to get such result only using geometry?
 

Minimization problem

Dear claudiocamera,
I hope I'm not missing anything. The solution seems to be as follows:
Draw the line 2X+Y=C then draw a line from (0,0) perpendicular to it. The intersection point will be the optimum point. The minimum value will be the second line length squared.
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top