运筹学软件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.
- j( A* q4 @+ ?  ?5 l4 c' I% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
8 e  o1 ]) {8 J" a  E" r0 Z; J. H( ]% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
, E2 ~; Y# i( R" W& P% b$ s% 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=[].

$ o" A4 x! L) _$ C; f7 k/ E% D.C. Hanselman, University of Maine, Orono ME,  04469
& [( F6 h: p$ e! d3 \% 1/26/94
- W$ }" j2 G5 j3 N) L% Copyright (c) 1996 by Prentice-Hall, Inc.

[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
% F1 o6 c% E; A' \# ]/ I% O- Kif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
- C! m- T: t5 ~6 s3 o( L+ Ybelow=tab(:,col)<val;
4 l: f  P' \9 P, J; @4 y. V; xequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
9 n$ C, A/ G( l% _8 S" \7 R9 z; O/ K        return
$ p% u* K' X0 _( c) z# K& kend
: X& Y- _7 H7 Z& {/ u, F4 Bpslope=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
/ G( t% V) r6 k& O8 ~
7 c8 C0 |0 C+ |3 U/ pib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
3 e& f+ w+ v9 p* Q: Eie=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y
, c$ {/ V: [6 d4 J8 W- I% k
y=zeros(ry,ct);                                % poke data into a zero matrix
# {: B: v+ b9 T4 r0 ^& f) J
# y# ?: b% L# G: X+ K# S6 l6 ralpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
6 L* Y9 V% V+ i1 C0 talpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
% A1 D2 X/ G. g  O" j7 Y
y(ieq,=tab(ie,;                        % equal values
+ H, {' y/ \$ a3 D4 A+ xy(:,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
* M: {, Z9 d$ X( A6 q! t! M3 @: p% TAB searching for the scalar value VAL in the column COL.
2 Q  u9 ]' `9 B( {$ H. ?' I0 a/ ^% 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
9 n4 O+ p+ Y* J4 b' L% many columns as TAB. Naturally, the column COL of Y contains
. A8 n3 k  Q% Z4 Z* L  C, y4 p% the value VAL. If VAL is not found in the table, Y=[].
  ~5 B8 q- C, v/ \* Q, N% {0 }" l
. x0 ~9 x1 c' t0 L: T% D.C. Hanselman, University of Maine, Orono ME,  04469
2 J* n2 R7 v' g8 G, _% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
3 Z* \5 @6 i; J. v
[rt,ct]=size(tab);
" I# B6 N$ ?1 ?/ C9 {8 E& @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
/ |7 _( d0 ~* S0 uabove=tab(:,col)>val;
below=tab(:,col)<val;
: G. @( J. `' v, j% ]equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
" _9 N- b' f. {$ A6 b5 Y        return
end
4 `4 v, q" i* ^pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
! V& t2 o, e( q, M# Jnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=sort([pslope;nslope+1]);        % put indices below in order
% F! Q7 P. [+ m$ X) R# ]ia=sort([nslope;pslope+1]);        % put indices above in order
) h$ X# q& x3 x) j0 K4 Qie=find(equal);                                % indices where equal to val
  ?( Q. O# Y' V/ j
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
8 R% X6 C4 w5 J% C4 j# G2 jalpha=alpha(:,ones(1,ct));
  O, r$ `  o* f5 Y) j9 ]y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
2 \2 x! U, O) n) F  a; i+ @
y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程