线性约束规划问题java求解

Linear programming.

 
 

  
  
 
 
Linear programming solvers.
 
 

  
Simplex.java is a bare-bones versionof the simplex algorithm.
  
QSoptis a Java linear program solver created by David Applegate, William Cook,Sanjeeb Dash, and Monika Mevenkamp.It can be used at no cost for research or education purposes.QSoptSolver.java solves a linear programin LP format, such as beer.lp.
  
Matlabcontains a linear programming solver in the optimization toolbox.
   
   

    
    

     

      

       
[wayne:tombstone] ~> matlab
                                      < M A T L A B (R) >
                            Copyright 1984-2009 The MathWorks, Inc.
                          Version 7.9.0.529 (R2009b) 64-bit (glnxa64)
                                        August 12, 2009
>> A = [5 15; 4 4; 35 20];
>> b = [480; 160; 1190];
>> c = [13; 23];

>> lb = [0; 0];
>> ub = [inf; inf];
>> x = linprog(-c, A, b, [], [], lb, ub)
x =
    12.0000
    28.0000

      
     
    
   
   
  
CPLEXis a high-performance mathematical programming solverfor linear programming, mixed integer programming, and quadratic programming.It supports interfaces to C, C++, Java, Python, Matlab, and Microsoft Excel.It is also accessible via the modeling systems includingAIMMS, AMPL, GAMS, and MPL.
  
AMPL is a modeling language for mathematical programming.The files beer.mod and beer.datspecify the model and data for the brewery problem.
   
   

    
    

     

      

       
[wayne:tombstone] ~> ampl
ILOG AMPL 9.100
AMPL Version 20021038 (SunOS 5.8)

ampl: model beer.mod;

ampl: data beer.dat;

ampl: solve;
ILOG CPLEX 9.100 
CPLEX 9.1.0: optimal solution; objective 800
2 dual simplex iterations (1 in phase I)

ampl: display x;
x [*] :=  ale 12