运筹学软件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.
. f4 e+ ?  f8 _! y( x/ j5 S% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
! n0 C. ~8 K1 j" a% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
7 `# s5 A7 Z: t7 U0 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=[].
3 M8 w, j) Y+ J+ k' ~, ^9 e9 k4 P& w
% D.C. Hanselman, University of Maine, Orono ME,  04469
4 G$ w) J6 P) D% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
+ f$ e* E! K" f6 @
8 I% `* H9 m/ ?# L- Y5 i2 T[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
if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
! f$ {' W5 n/ n1 jbelow=tab(:,col)<val;
- {) A" j% E8 k% O! T  ?4 r" I1 Eequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
3 j- {5 e# `' c) g" {& [0 ^' C        y=tab(find(equal),;
, N# e0 P1 p- {" T- F! Y5 U        return
- ?7 ^% r0 b% [# P8 j( v: Xend
4 f# {- m3 z: gpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
+ I" [5 ~  f' D' r8 Unslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
, Y8 {8 z! z9 T. g$ w9 t# a
ib=sort([pslope;nslope+1]);        % put indices below in order
, ^$ P" g; X: ria=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val

# u- Y; e7 \2 ?. V# @. X7 ][tmp,ix]=sort([ib;ie]);                % find where equals fit in result
! u# h- M3 I4 a# ?% uieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

! m- m- X% t1 ~" F/ ly=zeros(ry,ct);                                % poke data into a zero matrix
# y, h8 h, R8 e! i
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
9 k# O4 ]+ u, o- q( ], K. ^y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

3 q' m; _3 U5 _0 q9 A2 ky(ieq,=tab(ie,;                        % equal values
: @; \5 [) B+ r/ ey(:,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.
% 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
% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
: _$ X9 Q* S( E% [. k% Copyright (c) 1996 by Prentice-Hall, Inc.

1 e7 u) G" ?+ j6 G# U[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
if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
$ g# H- O  S/ @7 d% abelow=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
9 s6 R( n( o3 m, W, v- T& i: d$ o        y=tab(find(equal),;
- O, i& S, a8 j( c# F% @  t        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
$ Q% i3 [  j5 Z" u% M& ]nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=sort([pslope;nslope+1]);        % put indices below in order
3 d! X5 m- M7 R* F: hia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
# E( o; J* c" `$ W( {9 `" e
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
) ^  w7 v+ j% v5 g! u' B+ V3 Iry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix
0 G& H9 U. B$ `
+ q8 k  r) X" k" X0 R' Qalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
5 y9 @2 i* u+ H0 z0 u, zalpha=alpha(:,ones(1,ct));
9 L0 j+ G# l5 O* s4 n8 Ay(~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

lingo 教程