亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? glpk.h

?? 著名的大規模線性規劃求解器源碼GLPK.C語言版本,可以修剪.內有詳細幫助文檔.
?? H
?? 第 1 頁 / 共 4 頁
字號:
const char *lpx_get_row_name(LPX *lp, int i);/* retrieve row name */#define lpx_get_col_name _glp_lpx_get_col_nameconst char *lpx_get_col_name(LPX *lp, int j);/* retrieve column name */#define lpx_get_row_type _glp_lpx_get_row_typeint lpx_get_row_type(LPX *lp, int i);/* retrieve row type */#define lpx_get_row_lb _glp_lpx_get_row_lbdouble lpx_get_row_lb(LPX *lp, int i);/* retrieve row lower bound */#define lpx_get_row_ub _glp_lpx_get_row_ubdouble lpx_get_row_ub(LPX *lp, int i);/* retrieve row upper bound */#define lpx_get_row_bnds _glp_lpx_get_row_bndsvoid lpx_get_row_bnds(LPX *lp, int i, int *typx, double *lb,      double *ub);/* retrieve row bounds */#define lpx_get_col_type _glp_lpx_get_col_typeint lpx_get_col_type(LPX *lp, int j);/* retrieve column type */#define lpx_get_col_lb _glp_lpx_get_col_lbdouble lpx_get_col_lb(LPX *lp, int j);/* retrieve column lower bound */#define lpx_get_col_ub _glp_lpx_get_col_ubdouble lpx_get_col_ub(LPX *lp, int j);/* retrieve column upper bound */#define lpx_get_col_bnds _glp_lpx_get_col_bndsvoid lpx_get_col_bnds(LPX *lp, int j, int *typx, double *lb,      double *ub);/* retrieve column bounds */#define lpx_get_obj_coef _glp_lpx_get_obj_coefdouble lpx_get_obj_coef(LPX *lp, int j);/* retrieve obj. coefficient or constant term */#define lpx_get_num_nz _glp_lpx_get_num_nzint lpx_get_num_nz(LPX *lp);/* retrieve number of constraint coefficients */#define lpx_get_mat_row _glp_lpx_get_mat_rowint lpx_get_mat_row(LPX *lp, int i, int ind[], double val[]);/* retrieve row of the constraint matrix */#define lpx_get_mat_col _glp_lpx_get_mat_colint lpx_get_mat_col(LPX *lp, int j, int ind[], double val[]);/* retrieve column of the constraint matrix */#define lpx_create_index _glp_lpx_create_indexvoid lpx_create_index(LPX *lp);/* create the name index */#define lpx_find_row _glp_lpx_find_rowint lpx_find_row(LPX *lp, const char *name);/* find row by its name */#define lpx_find_col _glp_lpx_find_colint lpx_find_col(LPX *lp, const char *name);/* find column by its name */#define lpx_delete_index _glp_lpx_delete_indexvoid lpx_delete_index(LPX *lp);/* delete the name index */#define lpx_scale_prob _glp_lpx_scale_probvoid lpx_scale_prob(LPX *lp);/* scale problem data */#define lpx_unscale_prob _glp_lpx_unscale_probvoid lpx_unscale_prob(LPX *lp);/* unscale problem data */#define lpx_set_row_stat _glp_lpx_set_row_statvoid lpx_set_row_stat(LPX *lp, int i, int stat);/* set (change) row status */#define lpx_set_col_stat _glp_lpx_set_col_statvoid lpx_set_col_stat(LPX *lp, int j, int stat);/* set (change) column status */#define lpx_std_basis _glp_lpx_std_basisvoid lpx_std_basis(LPX *lp);/* construct standard initial LP basis */#define lpx_adv_basis _glp_lpx_adv_basisvoid lpx_adv_basis(LPX *lp);/* construct advanced initial LP basis */#define lpx_cpx_basis _glp_lpx_cpx_basisvoid lpx_cpx_basis(LPX *lp);/* construct Bixby's initial LP basis */#define lpx_simplex _glp_lpx_simplexint lpx_simplex(LPX *lp);/* easy-to-use driver to the simplex method */#define lpx_exact _glp_lpx_exactint lpx_exact(LPX *lp);/* easy-to-use driver to the exact simplex method */#define lpx_get_status _glp_lpx_get_statusint lpx_get_status(LPX *lp);/* retrieve generic status of basic solution */#define lpx_get_prim_stat _glp_lpx_get_prim_statint lpx_get_prim_stat(LPX *lp);/* retrieve primal status of basic solution */#define lpx_get_dual_stat _glp_lpx_get_dual_statint lpx_get_dual_stat(LPX *lp);/* retrieve dual status of basic solution */#define lpx_get_obj_val _glp_lpx_get_obj_valdouble lpx_get_obj_val(LPX *lp);/* retrieve objective value (basic solution) */#define lpx_get_row_stat _glp_lpx_get_row_statint lpx_get_row_stat(LPX *lp, int i);/* retrieve row status (basic solution) */#define lpx_get_row_prim _glp_lpx_get_row_primdouble lpx_get_row_prim(LPX *lp, int i);/* retrieve row primal value (basic solution) */#define lpx_get_row_dual _glp_lpx_get_row_dualdouble lpx_get_row_dual(LPX *lp, int i);/* retrieve row dual value (basic solution) */#define lpx_get_row_info _glp_lpx_get_row_infovoid lpx_get_row_info(LPX *lp, int i, int *tagx, double *vx,      double *dx);/* obtain row solution information */#define lpx_get_col_stat _glp_lpx_get_col_statint lpx_get_col_stat(LPX *lp, int j);/* retrieve column status (basic solution) */#define lpx_get_col_prim _glp_lpx_get_col_primdouble lpx_get_col_prim(LPX *lp, int j);/* retrieve column primal value (basic solution) */#define lpx_get_col_dual _glp_lpx_get_col_dualdouble lpx_get_col_dual(glp_prob *lp, int j);/* retrieve column dual value (basic solution) */#define lpx_get_col_info _glp_lpx_get_col_infovoid lpx_get_col_info(LPX *lp, int j, int *tagx, double *vx,      double *dx);/* obtain column solution information (obsolete) */#define lpx_get_ray_info _glp_lpx_get_ray_infoint lpx_get_ray_info(LPX *lp);/* determine what causes primal unboundness */#define lpx_check_kkt _glp_lpx_check_kktvoid lpx_check_kkt(LPX *lp, int scaled, LPXKKT *kkt);/* check Karush-Kuhn-Tucker conditions */#define lpx_warm_up _glp_lpx_warm_upint lpx_warm_up(LPX *lp);/* "warm up" LP basis */#define lpx_eval_tab_row _glp_lpx_eval_tab_rowint lpx_eval_tab_row(LPX *lp, int k, int ind[], double val[]);/* compute row of the simplex table */#define lpx_eval_tab_col _glp_lpx_eval_tab_colint lpx_eval_tab_col(LPX *lp, int k, int ind[], double val[]);/* compute column of the simplex table */#define lpx_transform_row _glp_lpx_transform_rowint lpx_transform_row(LPX *lp, int len, int ind[], double val[]);/* transform explicitly specified row */#define lpx_transform_col _glp_lpx_transform_colint lpx_transform_col(LPX *lp, int len, int ind[], double val[]);/* transform explicitly specified column */#define lpx_prim_ratio_test _glp_lpx_prim_ratio_testint lpx_prim_ratio_test(LPX *lp, int len, const int ind[],      const double val[], int how, double tol);/* perform primal ratio test */#define lpx_dual_ratio_test _glp_lpx_dual_ratio_testint lpx_dual_ratio_test(LPX *lp, int len, const int ind[],      const double val[], int how, double tol);/* perform dual ratio test */#define lpx_interior _glp_lpx_interiorint lpx_interior(LPX *lp);/* easy-to-use driver to the interior point method */#define lpx_ipt_status _glp_lpx_ipt_statusint lpx_ipt_status(LPX *lp);/* retrieve status of interior-point solution */#define lpx_ipt_obj_val _glp_lpx_ipt_obj_valdouble lpx_ipt_obj_val(LPX *lp);/* retrieve objective value (interior point) */#define lpx_ipt_row_prim _glp_lpx_ipt_row_primdouble lpx_ipt_row_prim(LPX *lp, int i);/* retrieve row primal value (interior point) */#define lpx_ipt_row_dual _glp_lpx_ipt_row_dualdouble lpx_ipt_row_dual(LPX *lp, int i);/* retrieve row dual value (interior point) */#define lpx_ipt_col_prim _glp_lpx_ipt_col_primdouble lpx_ipt_col_prim(LPX *lp, int j);/* retrieve column primal value (interior point) */#define lpx_ipt_col_dual _glp_lpx_ipt_col_dualdouble lpx_ipt_col_dual(LPX *lp, int j);/* retrieve column dual value (interior point) */#define lpx_set_class _glp_lpx_set_classvoid lpx_set_class(LPX *lp, int klass);/* set problem class */#define lpx_get_class _glp_lpx_get_classint lpx_get_class(LPX *lp);/* determine problem klass */#define lpx_set_col_kind _glp_lpx_set_col_kindvoid lpx_set_col_kind(LPX *lp, int j, int kind);/* set (change) column kind */#define lpx_get_col_kind _glp_lpx_get_col_kindint lpx_get_col_kind(LPX *lp, int j);/* retrieve column kind */#define lpx_get_num_int _glp_lpx_get_num_intint lpx_get_num_int(LPX *lp);/* retrieve number of integer columns */#define lpx_get_num_bin _glp_lpx_get_num_binint lpx_get_num_bin(LPX *lp);/* retrieve number of binary columns */#define lpx_integer _glp_lpx_integerint lpx_integer(LPX *lp);/* easy-to-use driver to the branch-and-bound method */#define lpx_intopt _glp_lpx_intoptint lpx_intopt(LPX *lp);/* easy-to-use driver to the branch-and-bound method */#define lpx_mip_status _glp_lpx_mip_statusint lpx_mip_status(LPX *lp);/* retrieve status of MIP solution */#define lpx_mip_obj_val _glp_lpx_mip_obj_valdouble lpx_mip_obj_val(LPX *lp);/* retrieve objective value (MIP solution) */#define lpx_mip_row_val _glp_lpx_mip_row_valdouble lpx_mip_row_val(LPX *lp, int i);/* retrieve row value (MIP solution) */#define lpx_mip_col_val _glp_lpx_mip_col_valdouble lpx_mip_col_val(LPX *lp, int j);/* retrieve column value (MIP solution) */#define lpx_check_int _glp_lpx_check_intvoid lpx_check_int(LPX *lp, LPXKKT *kkt);/* check integer feasibility conditions */#define lpx_reset_parms _glp_lpx_reset_parmsvoid lpx_reset_parms(LPX *lp);/* reset control parameters to default values */#define lpx_set_int_parm _glp_lpx_set_int_parmvoid lpx_set_int_parm(LPX *lp, int parm, int val);/* set (change) integer control parameter */#define lpx_get_int_parm _glp_lpx_get_int_parmint lpx_get_int_parm(LPX *lp, int parm);/* query integer control parameter */#define lpx_set_real_parm _glp_lpx_set_real_parmvoid lpx_set_real_parm(LPX *lp, int parm, double val);/* set (change) real control parameter */#define lpx_get_real_parm _glp_lpx_get_real_parmdouble lpx_get_real_parm(LPX *lp, int parm);/* query real control parameter */#define lpx_read_mps _glp_lpx_read_mpsLPX *lpx_read_mps(const char *fname);/* read problem data in fixed MPS format */#define lpx_write_mps _glp_lpx_write_mpsint lpx_write_mps(LPX *lp, const char *fname);/* write problem data in fixed MPS format */#define lpx_read_bas _glp_lpx_read_basint lpx_read_bas(LPX *lp, const char *fname);/* read LP basis in fixed MPS format */#define lpx_write_bas _glp_lpx_write_basint lpx_write_bas(LPX *lp, const char *fname);/* write LP basis in fixed MPS format */#define lpx_read_freemps _glp_lpx_read_freempsLPX *lpx_read_freemps(const char *fname);/* read problem data in free MPS format */#define lpx_write_freemps _glp_lpx_write_freempsint lpx_write_freemps(LPX *lp, const char *fname);/* write problem data in free MPS format */#define lpx_read_cpxlp _glp_lpx_read_cpxlpLPX *lpx_read_cpxlp(const char *fname);/* read problem data in CPLEX LP format */#define lpx_write_cpxlp _glp_lpx_write_cpxlpint lpx_write_cpxlp(LPX *lp, const char *fname);/* write problem data in CPLEX LP format */#define lpx_read_model _glp_lpx_read_modelLPX *lpx_read_model(const char *model, const char *data,      const char *output);/* read LP/MIP model written in GNU MathProg language */#define lpx_print_prob _glp_lpx_print_probint lpx_print_prob(LPX *lp, const char *fname);/* write problem data in plain text format */#define lpx_print_sol _glp_lpx_print_solint lpx_print_sol(LPX *lp, const char *fname);/* write LP problem solution in printable format */#define lpx_print_sens_bnds _glp_lpx_print_sens_bndsint lpx_print_sens_bnds(LPX *lp, const char *fname);/* write bounds sensitivity information */#define lpx_print_ips _glp_lpx_print_ipsint lpx_print_ips(LPX *lp, const char *fname);/* write interior point solution in printable format */#define lpx_print_mip _glp_lpx_print_mipint lpx_print_mip(LPX *lp, const char *fname);/* write MIP problem solution in printable format */#define lpx_is_b_avail _glp_lpx_is_b_availint lpx_is_b_avail(LPX *lp);/* check if LP basis is available */#define lpx_write_pb _glp_lpx_write_pbint lpx_write_pb(LPX *lp, const char *fname, int normalized,      int binarize);/* write problem data in (normalized) OPB format */#define lpx_main _glp_lpx_mainint lpx_main(int argc, const char *argv[]);/* stand-alone LP/MIP solver */#ifdef __cplusplus}#endif#endif/* eof */

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
色综合中文字幕| 国产精品视频yy9299一区| 欧美日韩的一区二区| 欧美色倩网站大全免费| 欧美日韩免费电影| 欧美精品日日鲁夜夜添| 日韩欧美亚洲国产另类| 久久久一区二区| 亚洲欧美一区二区在线观看| 亚洲精品网站在线观看| 亚洲国产日韩精品| 麻豆专区一区二区三区四区五区| 另类综合日韩欧美亚洲| 国产一区在线不卡| 91麻豆视频网站| 在线成人免费观看| 久久精品视频网| 国产精品午夜在线观看| 亚洲午夜私人影院| 青青草国产成人av片免费| 国产精品一线二线三线精华| 色综合久久88色综合天天6 | 日韩免费看的电影| 国产亚洲1区2区3区| 国产精品不卡视频| 日本欧美韩国一区三区| 国产成人在线视频网站| 欧美影片第一页| 精品久久久久99| 中文字幕一区二区在线观看 | 国产成人免费视频| 91久久香蕉国产日韩欧美9色| 日韩一级片网址| 国产精品国模大尺度视频| 香蕉成人啪国产精品视频综合网| 国产一区二区免费视频| 色老综合老女人久久久| 精品国产在天天线2019| 亚洲裸体在线观看| 另类成人小视频在线| 97久久人人超碰| 精品国产青草久久久久福利| 亚洲欧美另类小说视频| 久久精品国产免费看久久精品| av电影一区二区| 日韩三级电影网址| 国产精品短视频| 精品在线亚洲视频| 91国偷自产一区二区使用方法| 久久综合色综合88| 亚洲va欧美va国产va天堂影院| 高清beeg欧美| 精品国产乱码久久久久久牛牛| 亚洲综合一区二区三区| 成人性生交大片免费看中文| 欧美一卡在线观看| 一区二区三区不卡在线观看| 成人黄动漫网站免费app| 日韩久久免费av| 国产欧美精品日韩区二区麻豆天美| 亚洲六月丁香色婷婷综合久久 | 国产精品一区二区在线看| 欧美日韩久久久一区| 国产精品你懂的在线| 国产精品资源在线| 日韩亚洲欧美中文三级| 国产精品盗摄一区二区三区| 国产一区二区伦理片| 欧美一级电影网站| 亚洲成人动漫在线观看| 色偷偷成人一区二区三区91| 日本一区二区三区国色天香| 极品美女销魂一区二区三区免费| 欧美色网一区二区| 亚洲天堂久久久久久久| 国产在线播放一区三区四| 欧美日韩国产一区| 亚洲女子a中天字幕| 99热在这里有精品免费| 国产欧美一二三区| 国v精品久久久网| 国产日韩欧美综合一区| 久久国产精品免费| 日韩欧美亚洲一区二区| 蜜臂av日日欢夜夜爽一区| 欧美老女人在线| 亚洲第一成人在线| 欧美日韩一卡二卡三卡 | 韩日av一区二区| 精品国产免费人成在线观看| 捆绑调教美女网站视频一区| 日韩视频免费观看高清完整版在线观看| 亚洲一区二区三区中文字幕在线| 日本黄色一区二区| 亚洲愉拍自拍另类高清精品| 色老汉av一区二区三区| 亚洲自拍偷拍综合| 欧美老年两性高潮| 天天综合网天天综合色| 51精品国自产在线| 麻豆专区一区二区三区四区五区| 精品99999| 国产黄人亚洲片| 中文字幕一区二区在线播放| 99久久国产免费看| 亚洲女同ⅹxx女同tv| 99久久综合色| 亚洲免费观看在线视频| 色吧成人激情小说| 亚洲综合久久av| 91精品国产色综合久久不卡蜜臀 | 色老头久久综合| 亚洲国产中文字幕| 欧美一级xxx| 国产精品一区二区久久精品爱涩 | 久久精品一区二区| 成人精品免费看| 玉米视频成人免费看| 欧美日韩中字一区| 美国十次综合导航| 国产农村妇女毛片精品久久麻豆 | 国产欧美精品一区aⅴ影院| gogo大胆日本视频一区| 亚洲一级二级在线| 日韩精品一区国产麻豆| 成人av中文字幕| 亚洲超丰满肉感bbw| 久久久一区二区三区捆绑**| 91在线视频18| 亚洲一级二级三级| 精品国产亚洲一区二区三区在线观看 | 三级精品在线观看| 精品日本一线二线三线不卡| 国产精品一区二区免费不卡 | 日韩成人午夜电影| 久久久久国产精品麻豆ai换脸| 99re6这里只有精品视频在线观看| 午夜精品福利久久久| 国产亚洲欧美在线| 在线视频欧美精品| 韩国成人在线视频| 一区二区三区在线免费| 日韩欧美国产综合在线一区二区三区 | 韩国v欧美v日本v亚洲v| 亚洲女厕所小便bbb| 欧美一区二区三区四区久久| 国产一区二区伦理| 亚洲成人资源在线| 欧美极品少妇xxxxⅹ高跟鞋| 欧美三级视频在线播放| 国产麻豆精品久久一二三| 亚洲午夜精品在线| 国产欧美日韩不卡免费| 91麻豆精品国产91| 91香蕉国产在线观看软件| 国内精品久久久久影院色| 伊人夜夜躁av伊人久久| xfplay精品久久| 欧美性大战xxxxx久久久| 国产自产2019最新不卡| 亚洲在线免费播放| 国产精品久久久久aaaa| 精品嫩草影院久久| 欧美视频自拍偷拍| 91污片在线观看| 成人福利视频在线| 国产在线一区二区| 日韩电影在线一区| 亚洲国产欧美在线| 亚洲一区二区三区四区五区中文| 亚洲欧美国产三级| 一区二区三区欧美日韩| 亚洲精品日日夜夜| 亚洲精品高清视频在线观看| 自拍偷在线精品自拍偷无码专区| 日本一区二区视频在线| 欧美国产日韩a欧美在线观看| 国产亚洲精品7777| 国产亚洲欧洲一区高清在线观看| 久久久久久久精| 国产清纯白嫩初高生在线观看91| 2020国产精品久久精品美国| 久久久久久久久蜜桃| 国产三级一区二区三区| 欧美国产亚洲另类动漫| 中文字幕中文字幕在线一区| 亚洲天堂久久久久久久| 亚洲免费av高清| 香蕉久久一区二区不卡无毒影院| 视频一区欧美日韩| 久久er99精品| 国产福利一区二区三区视频在线 | ...xxx性欧美| 一区二区三区中文字幕精品精品| 亚洲成人av一区二区| 日韩中文字幕麻豆| 国内精品视频666| jlzzjlzz亚洲女人18| 欧美午夜电影一区| 欧美一区二区三区日韩视频|