public static class CplexStatus

    implements Serializable

  {

    static final long serialVersionUID = -7367834674783924158L;

    int _status;

    String _name;

    public static final CplexStatus Unknown = new CplexStatus(0, "Unknown");

    static final int Unknown_Status = 0;

    public static final CplexStatus Optimal = new CplexStatus(1, "Optimal");

    static final int Optimal_Status = 1;

    public static final CplexStatus Unbounded = new CplexStatus(2, "Unbounded");

    static final int Unbounded_Status = 2;

    public static final CplexStatus Infeasible = new CplexStatus(3, "Infeasible");

    static final int Infeasible_Status = 3;

    public static final CplexStatus InfOrUnbd = new CplexStatus(4, "InfOrUnbd");

    static final int InfOrUnbd_Status = 4;

    public static final CplexStatus OptimalInfeas = new CplexStatus(5, "OptimalInfeas");

    static final int OptimalInfeas_Status = 5;

    public static final CplexStatus NumBest = new CplexStatus(6, "NumBest");

    static final int NumBest_Status = 6;

    public static final CplexStatus FeasibleRelaxedSum = new CplexStatus(14, "FeasibleRelaxedSum");

    static final int FeasibleRelaxedSum_Status = 14;

    public static final CplexStatus OptimalRelaxedSum = new CplexStatus(15, "OptimalRelaxedSum");

    static final int OptimalRelaxedSum_Status = 15;

    public static final CplexStatus FeasibleRelaxedInf = new CplexStatus(16, "FeasibleRelaxedInf");

    static final int FeasibleRelaxedInf_Status = 16;

    public static final CplexStatus OptimalRelaxedInf = new CplexStatus(17, "OptimalRelaxedInf");

    static final int OptimalRelaxedInf_Status = 17;

    public static final CplexStatus FeasibleRelaxedQuad = new CplexStatus(18, "FeasibleRelaxedQuad");

    static final int FeasibleRelaxedQuad_Status = 18;

    public static final CplexStatus OptimalRelaxedQuad = new CplexStatus(19, "OptimalRelaxedQuad");

    static final int OptimalRelaxedQuad_Status = 19;

    public static final CplexStatus AbortRelaxed = new CplexStatus(126, "AbortRelaxed");

    static final int AbortRelaxed_Status = 126;

    public static final CplexStatus AbortObjLim = new CplexStatus(12, "AbortObjLim");

    static final int AbortObjLim_Status = 12;

    public static final CplexStatus AbortPrimObjLim = new CplexStatus(21, "AbortPrimObjLim");

    static final int AbortPrimObjLim_Status = 21;

    public static final CplexStatus AbortDualObjLim = new CplexStatus(22, "AbortDualObjLim");

    static final int AbortDualObjLim_Status = 22;

    public static final CplexStatus AbortItLim = new CplexStatus(10, "AbortItLim");

    static final int AbortItLim_Status = 10;

    public static final CplexStatus AbortTimeLim = new CplexStatus(11, "AbortTimeLim");

    static final int AbortTimeLim_Status = 11;

    public static final CplexStatus AbortDetTimeLim = new CplexStatus(25, "AbortDetTimeLim");

    static final int AbortDetTimeLim_Status = 25;

    public static final CplexStatus AbortUser = new CplexStatus(13, "AbortUser");

    static final int AbortUser_Status = 13;

    public static final CplexStatus OptimalFaceUnbounded = new CplexStatus(20, "OptimalFaceUnbounded");

    static final int OptimalFaceUnbounded_Status = 20;

    public static final CplexStatus OptimalTol = new CplexStatus(102, "OptimalTol");

    static final int OptimalTol_Status = 102;

    public static final CplexStatus SolLim = new CplexStatus(104, "SolLim");

    static final int SolLim_Status = 104;

    public static final CplexStatus PopulateSolLim = new CplexStatus(128, "PopulateSolLim");

    static final int PopulateSolLim_Status = 128;

    public static final CplexStatus NodeLimFeas = new CplexStatus(105, "NodeLimFeas");

    static final int NodeLimFeas_Status = 105;

    public static final CplexStatus NodeLimInfeas = new CplexStatus(106, "NodeLimInfeas");

    static final int NodeLimInfeas_Status = 106;

    public static final CplexStatus FailFeas = new CplexStatus(109, "FailFeas");

    static final int FailFeas_Status = 109;

    public static final CplexStatus FailInfeas = new CplexStatus(110, "FailInfeas");

    static final int FailInfeas_Status = 110;

    public static final CplexStatus MemLimFeas = new CplexStatus(111, "MemLimFeas");

    static final int MemLimFeas_Status = 111;

    public static final CplexStatus MemLimInfeas = new CplexStatus(112, "MemLimInfeas");

    static final int MemLimInfeas_Status = 112;

    public static final CplexStatus FailFeasNoTree = new CplexStatus(116, "FailFeasNoTree");

    static final int FailFeasNoTree_Status = 116;

    public static final CplexStatus FailInfeasNoTree = new CplexStatus(117, "FailInfeasNoTree");

    static final int FailInfeasNoTree_Status = 117;

    public static final CplexStatus ConflictFeasible = new CplexStatus(30, "ConflictFeasible");

    static final int ConflictFeasible_Status = 30;

    public static final CplexStatus ConflictMinimal = new CplexStatus(31, "ConflictMinimal");

    static final int ConflictMinimal_Status = 31;

    public static final CplexStatus ConflictAbortContradiction = new CplexStatus(32, "ConflictAbortContradiction");

    static final int ConflictAbortContradiction_Status = 32;

    public static final CplexStatus ConflictAbortTimeLim = new CplexStatus(33, "ConflictAbortTimeLim");

    static final int ConflictAbortTimeLim_Status = 33;

    public static final CplexStatus ConflictAbortDetTimeLim = new CplexStatus(39, "ConflictAbortDetTimeLim");

    static final int ConflictAbortDetTimeLim_Status = 39;

    public static final CplexStatus ConflictAbortItLim = new CplexStatus(34, "ConflictAbortItLim");

    static final int ConflictAbortItLim_Status = 34;

    public static final CplexStatus ConflictAbortNodeLim = new CplexStatus(35, "ConflictAbortNodeLim");

    static final int ConflictAbortNodeLim_Status = 35;

    public static final CplexStatus ConflictAbortObjLim = new CplexStatus(36, "ConflictAbortObjLim");

    static final int ConflictAbortObjLim_Status = 36;

    public static final CplexStatus ConflictAbortMemLim = new CplexStatus(37, "ConflictAbortMemLim");

    static final int ConflictAbortMemLim_Status = 37;

    public static final CplexStatus ConflictAbortUser = new CplexStatus(38, "ConflictAbortUser");

    static final int ConflictAbortUser_Status = 38;

    public static final CplexStatus Feasible = new CplexStatus(23, "Feasible");

    static final int Feasible_Status = 23;

    public static final CplexStatus OptimalPopulated = new CplexStatus(129, "OptimalPopulated");

    static final int OptimalPopulated_Status = 129;

    public static final CplexStatus OptimalPopulatedTol = new CplexStatus(130, "OptimalPopulatedTol");

    static final int OptimalPopulatedTol_Status = 130;

    public static final CplexStatus RelaxationUnbounded = new CplexStatus(133, "RelaxationUnbounded");

    static final int RelaxationUnbounded_Status = 133;

    public static final CplexStatus FirstOrder = new CplexStatus(24, "FirstOrder");

    static final int FirstOrder_Status = 24;

　　

cplexJava源码---计算结果的更多相关文章

  1. java源码——计算大于一个数的最小素数

    根据输入数字,计算大于一个数的最小素数. 话不多说,直接贴码. package com.fuxuemingzhu.countprime.main; import java.util.Scanner; ...

  2. java源码——计算不同图形的周长和面积

    计算任意三角形,正方形,正五边形,圆形的周长和面积. 利用类的继承实现. 将计算结果进行输出. 不多说,贴码. Contants.java 常量存储类 <pre name="code& ...

  3. java源码——计算立体图形的表面积和体积

    计算球,圆柱,圆锥的表面积和体积. 利用接口实现. 上代码. Contants.java 常量存储类 package com.fuxuemingzhu.solidgraphics.contants; ...

  4. Fresco 源码分析(三) Fresco服务端处理(2) Producer具体实现的内容

    我们以mProducerFactory.newNetworkFetchProducer()为例,因为这些创建新的producer的方式类似,区别在于是否有包装的处理器,即如果当前处理器中没有正在处理的 ...

  5. Unity UGUI图文混排源码(一)

    Unity UGUI图文混排源码(一):http://blog.csdn.net/qq992817263/article/details/51112304 Unity UGUI图文混排源码(二):ht ...

  6. 【OpenCV】SIFT原理与源码分析：关键点描述

    <SIFT原理与源码分析>系列文章索引:http://www.cnblogs.com/tianyalu/p/5467813.html 由前一篇<方向赋值>,为找到的关键点即SI ...

  7. 基于案例贯通 Spark Streaming 流计算框架的运行源码

    本期内容 : Spark Streaming+Spark SQL案例展示 基于案例贯穿Spark Streaming的运行源码 一. 案例代码阐述 : 在线动态计算电商中不同类别中最热门的商品排名,例 ...

  8. Apache Spark源码走读之20 -- ShuffleMapTask计算结果的保存与读取

    欢迎转载,转载请注明出处,徽沪一郎. 概要 ShuffleMapTask的计算结果保存在哪,随后Stage中的task又是如何知道从哪里去读取的呢,这个过程一直让我困惑不已. 用比较通俗一点的说法来解 ...

  9. Spark源码剖析 - 计算引擎

    本章导读 RDD作为Spark对各种数据计算模型的统一抽象,被用于迭代计算过程以及任务输出结果的缓存读写.在所有MapReduce框架中,shuffle是连接map任务和reduce任务的桥梁.map ...

随机推荐

  1. Complete the Word

    ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring ...

  2. hdu2098 分拆素数和 素数筛

    将一个偶数拆成两个素数的和,欧拉筛暴力 #include<stdio.h> #include<string.h> #define N 10001 ]; ]; ,j; void ...

  3. 租酥雨的NOIP2018赛前日记

    租酥雨的NOIP2018赛前日记 离\(\mbox{NOIP2018}\)只剩下不到一个月的时间辣! 想想自己再过一个月就要退役了,觉得有必要把这段时间的一些计划与安排记录下来. 就从国庆收假开始吧. ...

  4. jquery的常用操作（操作html页面的Dom对象的元素）

    一:页面加载完成时,会执行jquery的方法(不需要等待图片加载完成,只要dom结构加载完成,就执行该方法) //第一种写法: $(document).ready(function() { // 执行 ...

  5. 剑指offer-特定二维数组中查找一个元素是否存在-二分搜索-二维数组

    int [][] array ={ {1,2,8,9}, {2,4,9,12}, {4,7,10,13}, {6,8,11,19} }; 在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都 ...

  6. Aria2+yaaw+Chrome插件BaiduExporter实现百度网盘下载

    Aria2+yaaw+Chrome插件BaiduExporter实现百度网盘下载 这篇博客主要为了解决百度网盘下载限速以及linux等操作系统无百度客户端的问题.主要包括两个方面第一个是aria2的安 ...

  7. js模板引擎之artTemplate

    http://www.cnblogs.com/52fhy/p/5393673.html artTemplate 不支持requre.js,悲剧啊,只能用juicer啊 这个还是比较有名的. 简介: a ...

  8. 通过手动安装来启动ZStack

    当您使用手动安装手册完成ZStack的安装之后,您可以继续进行一些必要的配置 以便用它来自动云环境.ZStack的管控工具zstack-ctl会安装到每一个ZStack管理节点,您可以使用它来控制本地 ...

  9. java中字符与字节的编码关系

    在 GB 2312 编码或 GBK 编码中,一个英文字母字符存储需要1个字节,一个汉字字符存储需要2个字节. 在UTF-8编码中,一个英文字母字符存储需要1个字节,一个汉字字符储存需要3到4个字节. ...

  10. TopCoder客户端安装

    参考:https://blog.csdn.net/github_39353095/article/details/76165940 首先,下载 Java 环境. https://www.java.co ...