| ²é¿´: 3911 | »Ø¸´: 0 | ||
freeseaÌú³æ (³õÈëÎÄ̳)
|
[ÇóÖú]
¡¾Çë½Ì¡¿matlabÇó½âº¬µÈÊ½Ô¼ÊøÏßÐԹ滮µÄ¶ÔżÎÊÌâ
|
|
The problem: min x1+3*x2+0.5*x3 s.t. x1<=2; x1+x2-x3=3; x1,x2,x3>=0 Correct solution is x1=2; x2=1; x3=0; dual solution is y=(-2; 3) I have made the following code, but the result of dual solution obtained from ¡°lambda¡± is not correct. clear % Parameters N=3;f=[1; 3; 0.5];lb=zeros(N,1); % Define Matrices A=[1 0 0];b=[2]; Aeq=[1 1 -1];beq=[3]; [x,fval,exitflag,output,lambda]=linprog(f,A,b,Aeq,beq,lb,[]) When the quality is transformed into inequality, the corresponding code is shown as follows: clear % Parameters N=3;f=[1; 3; 0.5];lb=zeros(N,1); % Define Matrices A=[1 0 0;1 1 -1;-1 -1 1];b=[2;3;-3]; [x,fval,exitflag,output,lambda]=linprog(f,A,b,[],[],lb,[]) These two paragraphs of codes can only get the correct answer to the primal problem, but they cannot get the right solution of dual problem. Could you tell me how to get to correct dual solution? Thanks a lot. |
» ²ÂÄãϲ»¶
ijЩ»ú¹¹£¬ÒÔЧÂʵÍΪÈÙ£¬ÒÔЧÂʵÍ×÷Ϊ´æÔÚ¸Ð
ÒѾÓÐ10È˻ظ´
½ñÌìÎñί»á¿ªÍêÁË£¬Ã÷Ìì³ö½á¹ûÂð
ÒѾÓÐ11È˻ظ´
ÓÐûÓдóÉñ°ïÎÒ¿´¿´»ù½ð´úÂë
ÒѾÓÐ9È˻ظ´
2026¹ú×ÔÈ»º¯ÆÀ·Ñµ½ÕË
ÒѾÓÐ23È˻ظ´
ÔÚ¼á±ù»¹¸Ç×ű±º£µÄʱºò£¬ÎÒ¿´µ½ÁËŷŵÄ÷»¨¡£
ÒѾÓÐ8È˻ظ´
½ñÈÕ²»·Å°ñ£¿Íø´«¹ú×ÔȻԤ¼Æ 8 Ô 27 Èտɲé½á¹û
ÒѾÓÐ22È˻ظ´
·Å°ñǰµÄ²»µ¶¨
ÒѾÓÐ18È˻ظ´
ʲôʱºò¿ª½±£¿
ÒѾÓÐ13È˻ظ´
Èç¹û´Ë¿ÌÄãÕýÔÚΪ¹ú»ù¸Ðµ½½¹ÂÇ£¬²»·ÁÀ´ÌýÌýÕâÊס¶»ù½ðÖ®Íâ¡·
ÒѾÓÐ8È˻ظ´
ûÓÐÈκÎÏûÏ¢-ÊDz»ÊǾÍÁ¹ÁË
ÒѾÓÐ10È˻ظ´
ÕÒµ½Ò»Ð©Ïà¹ØµÄ¾«»ªÌû×Ó£¬Ï£ÍûÓÐÓÃŶ~
matlabÏßÐԹ滮
ÒѾÓÐ5È˻ظ´
ÄÜ·ñÓÃMatlab Çó½â·ÇÏßÐԹ滮
ÒѾÓÐ4È˻ظ´
ÇóÖúmatlab½â·ÇÏßÐԹ滮¡£Çó´úÂë¡£
ÒѾÓÐ13È˻ظ´
¹ØÓÚmatlabÏßÐԹ滮 ±³°üÎÊÌâµÄ ½â·¨ Çó¾Èѽ~~·½³ÌÖªµÀ µ«²»ÖªµÀÈçºÎ½â´ð¡¤¡¤¡¤¡¤
ÒѾÓÐ4È˻ظ´
matlabÏßÐÔ¾ØÕó²»µÈʽÇó½â×öÓÅ»¯ÎÊÌâ
ÒѾÓÐ10È˻ظ´
¿ÆÑдÓСľ³æ¿ªÊ¼£¬ÈËÈËΪÎÒ£¬ÎÒΪÈËÈË









»Ø¸´´ËÂ¥
µã»÷ÕâÀïËÑË÷¸ü¶àÏà¹Ø×ÊÔ´
20