public class org.apache.commons.math.optimization.linear.SimplexSolver extends org.apache.commons.math.optimization.linear.AbstractLinearOptimizer
{
private static final double DEFAULT_EPSILON;
private static final int DEFAULT_ULPS;
private final double epsilon;
private final int maxUlps;
public void <init>()
{
org.apache.commons.math.optimization.linear.SimplexSolver v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
specialinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: void <init>(double,int)>(1.0E-6, 10);
return;
}
public void <init>(double, int)
{
int v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
double v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v := @parameter: double;
v := @parameter: int;
specialinvoke v.<org.apache.commons.math.optimization.linear.AbstractLinearOptimizer: void <init>()>();
v.<org.apache.commons.math.optimization.linear.SimplexSolver: double epsilon> = v;
v.<org.apache.commons.math.optimization.linear.SimplexSolver: int maxUlps> = v;
return;
}
private java.lang.Integer getPivotColumn(org.apache.commons.math.optimization.linear.SimplexTableau)
{
java.lang.Integer v;
byte v;
org.apache.commons.math.optimization.linear.SimplexTableau v;
int v, v, v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
double v, v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v := @parameter: org.apache.commons.math.optimization.linear.SimplexTableau;
v = 0.0;
v = null;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumObjectiveFunctions()>();
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getWidth()>();
v = v - 1;
if v >= v goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(0, v);
v = v cmpg v;
if v >= 0 goto label;
v = v;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
label:
v = v + 1;
goto label;
label:
return v;
}
private java.lang.Integer getPivotRow(org.apache.commons.math.optimization.linear.SimplexTableau, int)
{
java.lang.Integer v, v, v, v, v;
boolean v, v, v, v, v, v;
java.util.ArrayList v, v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
double v, v, v, v, v;
java.util.Iterator v, v;
org.apache.commons.math.optimization.linear.SimplexTableau v;
java.lang.Object v, v, v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v := @parameter: org.apache.commons.math.optimization.linear.SimplexTableau;
v := @parameter: int;
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = v;
v = 1.7976931348623157E308;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumObjectiveFunctions()>();
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getHeight()>();
if v >= v goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getWidth()>();
v = v - 1;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(v, v);
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(v, v);
v = v.<org.apache.commons.math.optimization.linear.SimplexSolver: int maxUlps>;
v = staticinvoke <org.apache.commons.math.util.Precision: int compareTo(double,double,int)>(v, 0.0, v);
if v <= 0 goto label;
v = v / v;
v = staticinvoke <java.lang.Double: int compare(double,double)>(v, v);
if v != 0 goto label;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
goto label;
label:
if v >= 0 goto label;
v = v;
v = new java.util.ArrayList;
specialinvoke v.<java.util.ArrayList: void <init>()>();
v = v;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
interfaceinvoke v.<java.util.List: boolean add(java.lang.Object)>(v);
label:
v = v + 1;
goto label;
label:
v = interfaceinvoke v.<java.util.List: int size()>();
if v != 0 goto label;
return null;
label:
v = interfaceinvoke v.<java.util.List: int size()>();
if v <= 1 goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumArtificialVariables()>();
if v <= 0 goto label;
v = interfaceinvoke v.<java.util.List: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = 0;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumArtificialVariables()>();
if v >= v goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getArtificialVariableOffset()>();
v = v + v;
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(v, v);
v = v.<org.apache.commons.math.optimization.linear.SimplexSolver: int maxUlps>;
v = staticinvoke <org.apache.commons.math.util.Precision: boolean equals(double,double,int)>(v, 1.0, v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: java.lang.Integer getBasicRow(int)>(v);
v = virtualinvoke v.<java.lang.Integer: boolean equals(java.lang.Object)>(v);
if v == 0 goto label;
return v;
label:
v = v + 1;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: int getIterations()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: int getMaxIterations()>();
v = v / 2;
if v >= v goto label;
v = null;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getWidth()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumObjectiveFunctions()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getWidth()>();
v = v - 1;
v = interfaceinvoke v.<java.util.List: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = v;
label:
if v >= v goto label;
v = virtualinvoke v.<java.lang.Integer: boolean equals(java.lang.Object)>(v);
if v != 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: java.lang.Integer getBasicRow(int)>(v);
if v == null goto label;
v = virtualinvoke v.<java.lang.Integer: boolean equals(java.lang.Object)>(v);
if v == 0 goto label;
if v >= v goto label;
v = v;
v = v;
label:
v = v + 1;
goto label;
label:
return v;
label:
v = interfaceinvoke v.<java.util.List: java.lang.Object get(int)>(0);
return v;
}
protected void doIteration(org.apache.commons.math.optimization.linear.SimplexTableau) throws org.apache.commons.math.exception.MaxCountExceededException, org.apache.commons.math.optimization.linear.UnboundedSolutionException
{
org.apache.commons.math.optimization.linear.UnboundedSolutionException v;
java.lang.Integer v, v;
int v, v, v, v, v, v, v, v, v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
double v, v;
org.apache.commons.math.optimization.linear.SimplexTableau v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v := @parameter: org.apache.commons.math.optimization.linear.SimplexTableau;
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: void incrementIterationsCounter()>();
v = specialinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: java.lang.Integer getPivotColumn(org.apache.commons.math.optimization.linear.SimplexTableau)>(v);
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
v = specialinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: java.lang.Integer getPivotRow(org.apache.commons.math.optimization.linear.SimplexTableau,int)>(v, v);
if v != null goto label;
v = new org.apache.commons.math.optimization.linear.UnboundedSolutionException;
specialinvoke v.<org.apache.commons.math.optimization.linear.UnboundedSolutionException: void <init>()>();
throw v;
label:
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(v, v);
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: void divideRow(int,double)>(v, v);
v = 0;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getHeight()>();
if v >= v goto label;
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
if v == v goto label;
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(v, v);
v = virtualinvoke v.<java.lang.Integer: int intValue()>();
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: void subtractRow(int,int,double)>(v, v, v);
label:
v = v + 1;
goto label;
label:
return;
}
protected void solvePhase1(org.apache.commons.math.optimization.linear.SimplexTableau) throws org.apache.commons.math.exception.MaxCountExceededException, org.apache.commons.math.optimization.linear.UnboundedSolutionException, org.apache.commons.math.optimization.linear.NoFeasibleSolutionException
{
org.apache.commons.math.optimization.linear.NoFeasibleSolutionException v;
org.apache.commons.math.optimization.linear.SimplexTableau v;
int v, v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
boolean v, v;
double v, v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v := @parameter: org.apache.commons.math.optimization.linear.SimplexTableau;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getNumArtificialVariables()>();
if v != 0 goto label;
return;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: boolean isOptimal()>();
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: void doIteration(org.apache.commons.math.optimization.linear.SimplexTableau)>(v);
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: int getRhsOffset()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: double getEntry(int,int)>(0, v);
v = v.<org.apache.commons.math.optimization.linear.SimplexSolver: double epsilon>;
v = staticinvoke <org.apache.commons.math.util.Precision: boolean equals(double,double,double)>(v, 0.0, v);
if v != 0 goto label;
v = new org.apache.commons.math.optimization.linear.NoFeasibleSolutionException;
specialinvoke v.<org.apache.commons.math.optimization.linear.NoFeasibleSolutionException: void <init>()>();
throw v;
label:
return;
}
public org.apache.commons.math.optimization.PointValuePair doOptimize() throws org.apache.commons.math.exception.MaxCountExceededException, org.apache.commons.math.optimization.linear.UnboundedSolutionException, org.apache.commons.math.optimization.linear.NoFeasibleSolutionException
{
java.util.Collection v;
org.apache.commons.math.optimization.GoalType v;
org.apache.commons.math.optimization.linear.LinearObjectiveFunction v;
org.apache.commons.math.optimization.linear.SimplexTableau v;
int v;
org.apache.commons.math.optimization.linear.SimplexSolver v;
org.apache.commons.math.optimization.PointValuePair v;
boolean v, v;
double v;
v := @this: org.apache.commons.math.optimization.linear.SimplexSolver;
v = new org.apache.commons.math.optimization.linear.SimplexTableau;
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: org.apache.commons.math.optimization.linear.LinearObjectiveFunction getFunction()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: java.util.Collection getConstraints()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: org.apache.commons.math.optimization.GoalType getGoalType()>();
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: boolean restrictToNonNegative()>();
v = v.<org.apache.commons.math.optimization.linear.SimplexSolver: double epsilon>;
v = v.<org.apache.commons.math.optimization.linear.SimplexSolver: int maxUlps>;
specialinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: void <init>(org.apache.commons.math.optimization.linear.LinearObjectiveFunction,java.util.Collection,org.apache.commons.math.optimization.GoalType,boolean,double,int)>(v, v, v, v, v, v);
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: void solvePhase1(org.apache.commons.math.optimization.linear.SimplexTableau)>(v);
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: void dropPhase1Objective()>();
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: boolean isOptimal()>();
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexSolver: void doIteration(org.apache.commons.math.optimization.linear.SimplexTableau)>(v);
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.optimization.linear.SimplexTableau: org.apache.commons.math.optimization.PointValuePair getSolution()>();
return v;
}
}