运筹学软件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.
7 R  J' }) J' t. G. y. W. F- T, L% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
: o) e6 t' P: S$ a% All crossings are found and TAB(:,COL) need not be monotonic.
- E. H' ^* b, z3 L0 ~6 B7 i: H% 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=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
2 X* w4 f, d! L% [: ^* [% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
& S3 I4 y, D: o# @' ^9 [
- j% p6 |3 c6 V2 F9 I[rt,ct]=size(tab);
8 @4 ^7 Z  R% G1 P9 hif length(val)>1, error('VAL must be a scalar.'), end
0 i: q& @3 `! [' b& Z4 V% oif col>ct|col<1,  error('Chosen column outside table width.'), end
" ^# l  c( t1 t: S6 B8 ?# u9 zif rt<2, error('Table too small or not oriented in columns.'), end
' G& Z) N9 y8 [7 Habove=tab(:,col)>val;
* C  S& ~  ?" F6 p4 k' q6 |below=tab(:,col)<val;
" h# `, E' _) F, P( fequal=tab(:,col)==val;
7 \$ J( ~. u* J; H# Eif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
+ \  G  L3 q6 }nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
9 \5 _' m" ?' o, O8 i
9 c3 j- r! u! y9 J: `, m  N6 iib=sort([pslope;nslope+1]);        % put indices below in order
% D7 O/ x( {* Ria=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
3 g0 H# k2 F9 B6 d" I; s/ {
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
6 h& D4 m& a- bieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y
5 q; ^! b4 q8 H
y=zeros(ry,ct);                                % poke data into a zero matrix
. U' I4 F% C, h5 w: [0 a4 c
* k6 m0 z) P' `! K) d$ T0 b5 Valpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
4 Q! U+ m3 l2 C7 W4 ]+ q! ralpha=alpha(:,ones(1,ct));
, T# F8 l# A# @: E2 }4 z% |y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
2 c9 R2 R0 J" p0 ^# j0 `# L%MMINTERP 1-D Table Search by Linear Interpolation.
  n6 R$ h5 p4 Q9 E3 b% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
, e2 ]; s! |0 g" V& p( w; A  c; `% TAB searching for the scalar value VAL in the column COL.
& v. G1 L* ]2 [3 t- n4 M. V- l  v% 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
% many columns as TAB. Naturally, the column COL of Y contains
9 _) o. g; C% c- h, d; `% B% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
1 L" w2 q- V9 r% i/ m* z% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
9 k1 `5 h+ l2 q0 u$ dif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
: l) O  q- {3 |) v3 pabove=tab(:,col)>val;
* c, ~% n, U& w7 r( Z) M3 F# N5 K% Dbelow=tab(:,col)<val;
equal=tab(:,col)==val;
7 l1 g. u& W' i7 r# aif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
! t2 e* O1 e  _        return
end
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

8 R- o6 j5 Z& u- {ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
) q; o% l' E' z6 _1 q% v( w) rie=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
5 T/ p" r# Y1 _: m! w# Y6 A1 Nieq=ix>length(ib);                        % True where equals values fit
' S( q* O1 O) h8 \7 }# F, rry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix
- q& r) n& O! ?" W
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
4 G: t2 \. P. ~) K5 s, P# D
y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程