运筹学软件lingo9.0下载（带附件）

mathtake

共享，有需要的下。求解线性规划最好用的软件。

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

就在这个网站上面有Lingo11的破解版，无限变量！！

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
! s# S& p" m! }' D% m4 H5 ]/ y. C%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
7 ^" Y9 o( {0 h- h# g% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
% Each crossing is returned as a separate row in Y and Y has as
7 V, _0 Q" I9 q: x6 v% j4 w( q% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
6 a8 s, j7 g, P! x! G% 1/26/94
/ T5 J3 T$ ^  s% Copyright (c) 1996 by Prentice-Hall, Inc.
& f# r& e6 z# Q: T; i0 {9 k
[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
. G" s! z& m  K. }+ P8 p- S6 Kif col>ct|col<1,  error('Chosen column outside table width.'), end
. c+ V9 G3 ~; T1 B# A) }0 V$ e% ~if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
' z$ e9 t6 t% x$ a        return
4 j2 |, w! p  A6 S* a$ [end
+ s- o" h9 x! X9 y2 H% fpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
9 ]. ?/ w7 x  e: L
ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val

$ A9 q2 b; }/ Z[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
% V4 M4 X1 A, \# p% K' V  Xieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y
, ?; x% q! j: L# v9 a% v2 {
( D* F5 N1 N0 @* a) l' Gy=zeros(ry,ct);                                % poke data into a zero matrix
* r- o; h4 J+ W- v' A
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
$ C2 p4 `& U5 i! ]9 C/ u0 aalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
) q: ~% M: U6 d3 r0 ~7 d; B% w
y(ieq,=tab(ie,;                        % equal values
! `9 H& g( h& }0 D# Y0 o0 B/ Sy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
- R& S' p: c& w1 [! D" C% All crossings are found and TAB(:,COL) need not be monotonic.
( [7 Q- Z* v5 n$ K  d% Each crossing is returned as a separate row in Y and Y has as
% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
$ L3 P; p) p/ p$ m* _" d
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
/ ^3 G4 w. A! T7 e0 {
! A3 }  s* D/ n: L  M( W[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
- W9 z; H, Z, M6 S' o# Qif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
+ _" z  e* R% O2 ?0 g, dbelow=tab(:,col)<val;
equal=tab(:,col)==val;
, `1 ~2 V: z/ e. Z  ^! f! Cif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
. B& ]6 Y0 D, D) ?" c6 j6 Q- y4 E9 R        return
end
+ _+ D8 Q/ A" `; mpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=sort([pslope;nslope+1]);        % put indices below in order
8 B6 y: o4 ]1 Q0 Y, uia=sort([nslope;pslope+1]);        % put indices above in order
9 A7 t  P5 T7 H0 v/ \# rie=find(equal);                                % indices where equal to val
; @4 @% |4 t9 q. F
4 l* h8 n0 K" I- l* F- z/ k[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
7 e; w3 m, D9 y. T7 f0 yieq=ix>length(ib);                        % True where equals values fit
& }( [+ b5 M4 j6 U( t4 [ry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix
2 d9 ]% Y& a7 v" q/ r% B5 s
; K0 s/ {" l: M! u# ?' Lalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
* L7 M$ R, A4 Z& S3 ealpha=alpha(:,ones(1,ct));
) d2 `- p: Z, P+ o& Jy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
/ Z8 q: }$ R0 O- [: C8 k
5 b: j2 i5 r, }4 t( Sy(ieq,=tab(ie,;                        % equal values
. \8 K9 p' `- l  b) a: m5 v  Qy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程