运筹学软件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.
0 @7 O( Y0 d6 p5 P4 ~0 [8 X  d& B% All crossings are found and TAB(:,COL) need not be monotonic.
& p& r' R) P7 m/ G( k' x1 T2 A% Each crossing is returned as a separate row in Y and Y has as
* I' v! P5 ]! u5 e8 T% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
# R8 T9 C" K3 M1 T
+ c1 x7 }) B: N( C1 e% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
  d1 s8 i- Q5 S7 w( W% Copyright (c) 1996 by Prentice-Hall, Inc.

2 E/ e; a& U% ?7 `* i* t  [( `9 d[rt,ct]=size(tab);
$ ~; ^! ?1 ~" E$ {, u5 Q1 `if length(val)>1, error('VAL must be a scalar.'), end
/ V% e* q' W  B' L3 f, eif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
( B* Q4 u7 N8 ?/ {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),;
  c) ?. f5 x) x. V        return
- m% D) @2 q, i! Z' zend
3 e! W7 R' L5 ypslope=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
; K9 F" R# C3 @9 C8 W4 j* k# f) T
ib=sort([pslope;nslope+1]);        % put indices below in order
/ V" }& C; @  jia=sort([nslope;pslope+1]);        % put indices above in order
5 x$ }/ v$ y+ g% G7 z" Mie=find(equal);                                % indices where equal to val
, M- M* |7 K. u2 U6 A; x
% X1 u0 {4 d" H+ I. \8 r$ {8 I[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
, P6 ~& c9 G9 g) t# ^8 J" Jieq=ix>length(ib);                        % True where equals values fit
0 G7 Q# M6 T2 `  rry=length(tmp);                                % # of rows in result y

4 e( D. B  a8 ]. c, s. b% o( _" Oy=zeros(ry,ct);                                % poke data into a zero matrix
. D1 @0 J: _+ P  K- e5 c/ G
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
6 f! _. c5 |- P$ Ealpha=alpha(:,ones(1,ct));
9 H' k3 e) \* F6 m8 }$ l) T" Xy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
( m( l. l# `0 Z. ~
y(ieq,=tab(ie,;                        % equal values
1 f. z' C  S% i5 ~y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
( G4 j/ a. v) J9 `%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
/ o7 [0 [7 N! g8 S$ e! f, Q% many columns as TAB. Naturally, the column COL of Y contains
0 Q% [9 n2 S* H4 p+ o$ j% the value VAL. If VAL is not found in the table, Y=[].
9 C% w5 F) `5 W& k9 D
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
9 C- p) h' x' b7 C5 ^& f% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
# \; u* @. f3 C% c7 M2 F' tif length(val)>1, error('VAL must be a scalar.'), end
6 b" L, B! A# Y5 M" O6 `9 M: `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
9 z- o: \. `: C* ?4 uabove=tab(:,col)>val;
below=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
% v" `+ N+ K6 ~# D        y=tab(find(equal),;
        return
end
; V. f7 u7 i8 w3 c6 ipslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
2 x7 g3 L6 \$ {nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

: L4 w% ]: Y) c& @6 o  B! mib=sort([pslope;nslope+1]);        % put indices below in order
8 [$ m: a- Y) a* Oia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
6 ]. H6 D+ r8 Q2 Q, C
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
! S# @8 U+ e# f' ?* s1 Iry=length(tmp);                                % # of rows in result y
! k' K4 y/ X0 m  T$ c4 b0 E7 `  @; Q
y=zeros(ry,ct);                                % poke data into a zero matrix

' H4 M$ W7 c& Q$ x( v" jalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
, Y9 N; C/ A* V8 q  Xalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
( X( v5 ]+ {' Q
2 V* I" \$ x3 P+ v& py(ieq,=tab(ie,;                        % equal values
! X: Z; P" g8 i$ I, Y) f' B+ Xy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程