【线性规划LP建模实例——化学工厂肥料】

线性规划LP建模实例——化学工厂肥料

Usine chimique
Required Files: engrais.mod, configExe
Dans une usine chimique on produit deux sortes d’engrais minéraux complexes en mélangeant plusieurs éléments fertilisants. Le produit A, composé d’un kilogramme de nitrates et de deux kilogrammes de sel de potassium, rapporte 7€ à la vente, et le produit B, composé d’un kilogramme de nitrates, un kilogramme de phosphates et trois kilogrammes de sel de potassium rapporte 9€. Actuellement il reste encore en stock 8kg de nitrates, 4kg de phosphates et 19kg de sel de potassium. Quelles quantités de chaque produit faut-il produire pour maximiser le bénéfice?
Modélisez en programme linéaire

configExe

engrais.mod

engrais.mod

/*********************************************
 * OPL 12.6.0.0 Model
 * Engrais
 *********************************************/

//Data declarations.
//Make sure you use c[i] to access the i-th cost 
//and do not remove/change the following line
float c[1..2] = [7,9];

//Decision variables.
dvar float+ A;
dvar float+ B;
maximize c[1]*A+c[2]*B;

//Constraints
subject to {
    A+B<=8;
    2*A+3*B<=19;
    B<=4;
}

// Display
execute {
  writeln("Post treatment: ");
  writeln("The objectif's value is  "+cplex.getObjValue());
} 

运行结果：

CP Optimizer (Community Edition) solves problems with a search space of up to 2^1000                                                
                                                                                                                                    
<<< setup, at 0s, took 1.64574e+09s                                                                                                 
                                                                                                                                    
                                                                                                                                    
<<< generate, at 0s, took 0.00416303s                                                                                               
                                                                                                                                    
Tried aggregator 1 time.                                                                                                            
LP Presolve eliminated 1 rows and 0 columns.                                                                                        
Reduced LP has 2 rows, 2 columns, and 4 nonzeros.                                                                                   
Presolve time = 0.00 sec. (0.00 ticks)                                                                                              
                                                                                                                                    
Iteration log . . .                                                                                                                 
Iteration:     1   Dual infeasibility =             1.000000                                                                        
Iteration:     3   Dual objective     =            62.000000                                                                        
                                                                                                                                    
<<< solve, at 0s, took 0.000536919s                                                                                                 
                                                                                                                                    
                                                                                                                                    
OBJECTIVE: 62                                                                                                                       
Post treatment:                                                                                                                     
The objectif's value is  62                                                                                                         
                                                                                                                                    
<<< post process, at 0s, took 0.00019908s                                                                                           
                                                                                                                                    
// solution (optimal) with objective 62                                                                                             
// Quality There are no bound infeasibilities.                                                                                      
// There are no reduced-cost infeasibilities.                                                                                       
// Maximum Ax-b  residual             = 0                                                                                           
// Maximum c-B'pi residual            = 4.44089e-16                                                                                 
// Maximum |x|                        = 5                                                                                           
// Maximum |slack|                    = 1                                                                                           
// Maximum |pi|                       = 3                                                                                           
// Maximum |red-cost|                 = 0                                                                                           
// Condition number of unscaled basis = 1.7e+01                                                                                     
//                                                                                                                                  
                                                                                                                                    
A = 5;                                                                                                                              
B = 3;                                                                                                                              
                                                                                                                                    
<<< done, at 0s, took 0.000173092s