首页> PeerJ. Computer science> A new non-monotonic infeasible simplex-type algorithm for Linear Programming.

A new non-monotonic infeasible simplex-type algorithm for Linear Programming.

导出 LinkOut

翻译打印收藏纠错

第一作者： Charalampos P,Triantafyllidis

第一单位： Computational Biology & Integrative Genomics, Department of Oncology, Medical Sciences Division, University of Oxford, Oxford, United Kingdom.

作者： Charalampos P,Triantafyllidis ^[1] ; Nikolaos,Samaras ^[2]

作者单位： Computational Biology & Integrative Genomics, Department of Oncology, Medical Sciences Division, University of Oxford, Oxford, United Kingdom. ^[1] Department of Applied Informatics, School of Information Sciences, University of Macedonia, Thessaloniki, Greece. ^[2]

关键词 Exterior point Infeasible Interior point method Linear programming Mathematical programming Non-monotonic Optimization Simplex-type

DOI 10.7717/peerj-cs.265

PMID 33816916

发布时间 2024-03-31

翻译满意度评价：

准确一般字义偏差语意偏离译文作用小提交

浏览0

PeerJ. Computer science

2020年6卷

e265页

相似文献

中文期刊
外文期刊
学位论文
会议论文

浏览0

点击下载本期目录封面

PeerJ. Computer science

2020年6卷

e265页

检索历史清除

A new non-monotonic infeasible simplex-type algorithm for Linear Programming.

PeerJ. Computer science

相似文献

同项目论文

PeerJ. Computer science

相关期刊

参考文献：
指定格式：	NoteExpress EndNote RefWorks NoteFirst

检索历史 清除

A new non-monotonic infeasible simplex-type algorithm for Linear Programming.

PeerJ. Computer science

相似文献

同项目论文

PeerJ. Computer science

相关期刊

检索历史清除