|
10-06-2009, 05:54 AM
| #1 |
| Registered User Join Date: Jan 2009
Posts: 49
| solve a,b,c,d and T find (x,y) such that ax+by=T and cx+dy is maximum ! this can be easily solved using Extended Euclid algorithm.But is there any simpler way using calculus ?? Thank you |
| jack_carver is offline |  |
|
10-06-2009, 05:55 AM
| #2 |
| +++ OK NO CARRIER  Join Date: Oct 2001
Posts: 10,260
| The math forum is that way: -----> Quzah.
__________________ Hundreds of thousands of dipshits can't be wrong. Are you up for the suck? |
| quzah is offline | |
|
10-06-2009, 10:58 AM
| #3 | |
| Senior software engineer  Join Date: Mar 2007 Location: Portland, OR
Posts: 5,381
| Quote:
1. Direct solution. Solve the constraint equation for y. Substitute this into the second equation to get an equation only in x. Take the derivative, set it equal to zero, solve for x. Now back-substitute the value of x into the constraint equation and solve for y. 2. Lagrange multipliers. Check Wikipedia.
__________________ "Congratulations on your purchase. To begin using your quantum computer, set the power switch to both off and on simultaneously." -- raftpeople@slashdot | |
| brewbuck is offline | |
 |
| Thread Tools | |
| Display Modes | |
|
Similar Threads | ||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| can anyone solve this for me? (look inside) | johnsonswww | C Programming | 10 | 03-02-2009 11:24 AM |
| Help. I don't know how to solve my problem in a program I wrote. | Hapster | C Programming | 2 | 04-25-2005 11:59 AM |
| help solve linking problem, thanks | Raison | Windows Programming | 8 | 05-29-2004 11:14 AM |
| please help me to solve the error | Jasonymk | C++ Programming | 8 | 05-02-2003 09:08 AM |
| Help to solve this problem | Romashka | C++ Programming | 3 | 04-16-2002 09:32 AM |
Linear Mode
