com.google.ortools.linearsolver.MPModelProtoOrBuilder Maven / Gradle / Ivy
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ortools/linear_solver/linear_solver.proto
package com.google.ortools.linearsolver;
public interface MPModelProtoOrBuilder extends
// @@protoc_insertion_point(interface_extends:operations_research.MPModelProto)
com.google.protobuf.MessageOrBuilder {
/**
*
* All the variables appearing in the model.
*
*
* repeated .operations_research.MPVariableProto variable = 3;
*/
java.util.List
getVariableList();
/**
*
* All the variables appearing in the model.
*
*
* repeated .operations_research.MPVariableProto variable = 3;
*/
com.google.ortools.linearsolver.MPVariableProto getVariable(int index);
/**
*
* All the variables appearing in the model.
*
*
* repeated .operations_research.MPVariableProto variable = 3;
*/
int getVariableCount();
/**
*
* All the variables appearing in the model.
*
*
* repeated .operations_research.MPVariableProto variable = 3;
*/
java.util.List extends com.google.ortools.linearsolver.MPVariableProtoOrBuilder>
getVariableOrBuilderList();
/**
*
* All the variables appearing in the model.
*
*
* repeated .operations_research.MPVariableProto variable = 3;
*/
com.google.ortools.linearsolver.MPVariableProtoOrBuilder getVariableOrBuilder(
int index);
/**
*
* All the constraints appearing in the model.
*
*
* repeated .operations_research.MPConstraintProto constraint = 4;
*/
java.util.List
getConstraintList();
/**
*
* All the constraints appearing in the model.
*
*
* repeated .operations_research.MPConstraintProto constraint = 4;
*/
com.google.ortools.linearsolver.MPConstraintProto getConstraint(int index);
/**
*
* All the constraints appearing in the model.
*
*
* repeated .operations_research.MPConstraintProto constraint = 4;
*/
int getConstraintCount();
/**
*
* All the constraints appearing in the model.
*
*
* repeated .operations_research.MPConstraintProto constraint = 4;
*/
java.util.List extends com.google.ortools.linearsolver.MPConstraintProtoOrBuilder>
getConstraintOrBuilderList();
/**
*
* All the constraints appearing in the model.
*
*
* repeated .operations_research.MPConstraintProto constraint = 4;
*/
com.google.ortools.linearsolver.MPConstraintProtoOrBuilder getConstraintOrBuilder(
int index);
/**
*
* All the general constraints appearing in the model. Note that not all
* solvers support all types of general constraints.
*
*
* repeated .operations_research.MPGeneralConstraintProto general_constraint = 7;
*/
java.util.List
getGeneralConstraintList();
/**
*
* All the general constraints appearing in the model. Note that not all
* solvers support all types of general constraints.
*
*
* repeated .operations_research.MPGeneralConstraintProto general_constraint = 7;
*/
com.google.ortools.linearsolver.MPGeneralConstraintProto getGeneralConstraint(int index);
/**
*
* All the general constraints appearing in the model. Note that not all
* solvers support all types of general constraints.
*
*
* repeated .operations_research.MPGeneralConstraintProto general_constraint = 7;
*/
int getGeneralConstraintCount();
/**
*
* All the general constraints appearing in the model. Note that not all
* solvers support all types of general constraints.
*
*
* repeated .operations_research.MPGeneralConstraintProto general_constraint = 7;
*/
java.util.List extends com.google.ortools.linearsolver.MPGeneralConstraintProtoOrBuilder>
getGeneralConstraintOrBuilderList();
/**
*
* All the general constraints appearing in the model. Note that not all
* solvers support all types of general constraints.
*
*
* repeated .operations_research.MPGeneralConstraintProto general_constraint = 7;
*/
com.google.ortools.linearsolver.MPGeneralConstraintProtoOrBuilder getGeneralConstraintOrBuilder(
int index);
/**
*
* True if the problem is a maximization problem. Minimize by default.
*
*
* optional bool maximize = 1 [default = false];
* @return Whether the maximize field is set.
*/
boolean hasMaximize();
/**
*
* True if the problem is a maximization problem. Minimize by default.
*
*
* optional bool maximize = 1 [default = false];
* @return The maximize.
*/
boolean getMaximize();
/**
*
* Offset for the objective function. Must be finite.
*
*
* optional double objective_offset = 2 [default = 0];
* @return Whether the objectiveOffset field is set.
*/
boolean hasObjectiveOffset();
/**
*
* Offset for the objective function. Must be finite.
*
*
* optional double objective_offset = 2 [default = 0];
* @return The objectiveOffset.
*/
double getObjectiveOffset();
/**
*
* Optionally, a quadratic objective.
* As of 2019/06, only SCIP and Gurobi support quadratic objectives.
*
*
* optional .operations_research.MPQuadraticObjective quadratic_objective = 8;
* @return Whether the quadraticObjective field is set.
*/
boolean hasQuadraticObjective();
/**
*
* Optionally, a quadratic objective.
* As of 2019/06, only SCIP and Gurobi support quadratic objectives.
*
*
* optional .operations_research.MPQuadraticObjective quadratic_objective = 8;
* @return The quadraticObjective.
*/
com.google.ortools.linearsolver.MPQuadraticObjective getQuadraticObjective();
/**
*
* Optionally, a quadratic objective.
* As of 2019/06, only SCIP and Gurobi support quadratic objectives.
*
*
* optional .operations_research.MPQuadraticObjective quadratic_objective = 8;
*/
com.google.ortools.linearsolver.MPQuadraticObjectiveOrBuilder getQuadraticObjectiveOrBuilder();
/**
*
* Name of the model.
*
*
* optional string name = 5 [default = ""];
* @return Whether the name field is set.
*/
boolean hasName();
/**
*
* Name of the model.
*
*
* optional string name = 5 [default = ""];
* @return The name.
*/
java.lang.String getName();
/**
*
* Name of the model.
*
*
* optional string name = 5 [default = ""];
* @return The bytes for name.
*/
com.google.protobuf.ByteString
getNameBytes();
/**
*
* Solution hint.
* If a feasible or almost-feasible solution to the problem is already known,
* it may be helpful to pass it to the solver so that it can be used. A solver
* that supports this feature will try to use this information to create its
* initial feasible solution.
* Note that it may not always be faster to give a hint like this to the
* solver. There is also no guarantee that the solver will use this hint or
* try to return a solution "close" to this assignment in case of multiple
* optimal solutions.
*
*
* optional .operations_research.PartialVariableAssignment solution_hint = 6;
* @return Whether the solutionHint field is set.
*/
boolean hasSolutionHint();
/**
*
* Solution hint.
* If a feasible or almost-feasible solution to the problem is already known,
* it may be helpful to pass it to the solver so that it can be used. A solver
* that supports this feature will try to use this information to create its
* initial feasible solution.
* Note that it may not always be faster to give a hint like this to the
* solver. There is also no guarantee that the solver will use this hint or
* try to return a solution "close" to this assignment in case of multiple
* optimal solutions.
*
*
* optional .operations_research.PartialVariableAssignment solution_hint = 6;
* @return The solutionHint.
*/
com.google.ortools.linearsolver.PartialVariableAssignment getSolutionHint();
/**
*
* Solution hint.
* If a feasible or almost-feasible solution to the problem is already known,
* it may be helpful to pass it to the solver so that it can be used. A solver
* that supports this feature will try to use this information to create its
* initial feasible solution.
* Note that it may not always be faster to give a hint like this to the
* solver. There is also no guarantee that the solver will use this hint or
* try to return a solution "close" to this assignment in case of multiple
* optimal solutions.
*
*
* optional .operations_research.PartialVariableAssignment solution_hint = 6;
*/
com.google.ortools.linearsolver.PartialVariableAssignmentOrBuilder getSolutionHintOrBuilder();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy