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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

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.
% All crossings are found and TAB(:,COL) need not be monotonic.
7 T2 T) S0 J0 E% Each crossing is returned as a separate row in Y and Y has as
, a$ Y1 N8 u5 y) d% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].

" P! `7 K* b( P$ J( N' g5 s$ E% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
2 c2 Q9 l& e) w
0 c5 D- ~, c# O2 d( g[rt,ct]=size(tab);
4 G  w9 D+ M* x" i0 B# E$ b. Yif length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
; ~* A, s+ v3 o) D. b! Wif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
5 Q0 f6 a3 j# h1 q- Wequal=tab(:,col)==val;
8 Z$ q* t% z, hif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
; S; z, |5 v& X4 C" j        return
end
7 j& v2 B; V2 H, T% J: l5 @pslope=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

: m! `1 \% \  }) jib=sort([pslope;nslope+1]);        % put indices below in order
) o3 \( N5 H  Q# Aia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
, R( {& i* s  F9 J
" U% R  x$ O1 d" v[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
! n0 n9 s  N; o( v1 ?' B: sieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

0 n# j1 p8 x3 _3 {y=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
0 x% B5 P% t" U8 P4 ]1 qalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
- I* U4 ^& Q0 T; Y/ l8 Z
; ~4 w2 C' U2 u. zy(ieq,=tab(ie,;                        % equal values
+ x0 {+ n: L3 e$ O( zy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
& I2 A0 e) X6 _% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
( s9 @. V3 Z  U6 U# R% TAB searching for the scalar value VAL in the column COL.
  `9 P6 ?; k( P) }( u7 y& k% 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
; K$ j% ~% P3 {& a3 n& u; ?% many columns as TAB. Naturally, the column COL of Y contains
! \1 l7 V7 ~0 y; \! B, U% _% the value VAL. If VAL is not found in the table, Y=[].
; E1 K. n- f& S7 A8 X
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
; M5 m2 _' N1 ], u# o
[rt,ct]=size(tab);
) i: R, r7 z, P. q: u6 Dif length(val)>1, error('VAL must be a scalar.'), end
8 Q9 S8 H9 Z( J) Vif col>ct|col<1,  error('Chosen column outside table width.'), end
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),;
        return
4 G3 m! L! ^" D* D) k" Send
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
2 a* x0 r6 N# d+ n8 U8 {9 lnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

( y$ U. ]* ]6 t) T  b1 v& a( \ib=sort([pslope;nslope+1]);        % put indices below in order
& ]4 K9 z; c) v) pia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
9 i6 F$ G  Y- i
0 n4 P  j& {. I- g$ ^[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
; X4 P' B* J. t+ S# [& S+ j" n% `ieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y
4 H) \9 W( s0 N1 W
& J9 k& e$ T( B/ C$ ~y=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

* k! Y3 Q* r6 ^' {8 D3 S  s6 xy(ieq,=tab(ie,;                        % equal values
( k( |2 @( ?$ C3 fy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程