com.joptimizer.optimizers.BIPOptimizationResponse Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of joptimizer Show documentation
Show all versions of joptimizer Show documentation
JOptimizer is a java library for solving general convex optimization problems, like for example LP, QP, QCQP, SOCP, SDP, GP and many more.
/*
* Copyright 2011-2014 JOptimizer
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.joptimizer.optimizers;
/**
* @author alberto trivellato ([email protected])
*/
public class BIPOptimizationResponse {
// public static final int RT_SUCCESS = 0;
// public static final int RT_ITERATION_EXCEEDED = 1;
/**
* The optimization retun code.
* If returnCode = RT_SUCCESS it is all ok, otherwise there is a problem. For example,
* when the algorithm exceeds the available number of iterations, returnCode = RT_ITERATION_EXCEEDED.
*/
//private int returnCode;
private int[] solution;
private double value;
// public void setReturnCode(int returnCode) {
// this.returnCode = returnCode;
// }
//
// public int getReturnCode() {
// return returnCode;
// }
public void setSolution(int[] solution) {
this.solution = solution;
}
public int[] getSolution() {
return solution;
}
public double getValue() {
throw new UnsupportedOperationException("not yet implemented");
}
public void setValue(double value) {
this.value = value;
}
}