• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种简化的无人工变量的单纯形法版本。

A streamlined artificial variable free version of simplex method.

作者信息

Inayatullah Syed, Touheed Nasir, Imtiaz Muhammad

机构信息

Department of Mathematical Sciences, University of Karachi, Karachi, Pakistan.

Department of Mathematical Sciences, Institute of Business Administration, Karachi, Pakistan.

出版信息

PLoS One. 2015 Mar 13;10(3):e0116156. doi: 10.1371/journal.pone.0116156. eCollection 2015.

DOI:10.1371/journal.pone.0116156
PMID:25767883
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC4358952/
Abstract

This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting sequence as of simplex phase 1 without showing any explicit description of artificial variables which also makes it space efficient. Later in this paper, a dual version of the new method has also been presented which provides a way to easily implement the phase 1 of traditional dual simplex method. For a problem having an initial basis which is both primal and dual infeasible, our methods provide full freedom to the user, that whether to start with primal artificial free version or dual artificial free version without making any reformulation to the LP structure. Last but not the least, it provides a teaching aid for the teachers who want to teach feasibility achievement as a separate topic before teaching optimality achievement.

摘要

本文提出了一种简化形式的单纯形法,与传统单纯形法相比具有一些显著优势。例如,它不需要任何类型的人工变量或人工约束;可以从线性规划(LP)的任何可行或不可行基开始。该方法遵循与单纯形法第1阶段相同的转轴序列,无需明确显示人工变量,这也使其具有空间效率。本文后面还给出了新方法的对偶形式,为轻松实现传统对偶单纯形法的第1阶段提供了一种途径。对于初始基既不可行又对偶不可行的问题,我们的方法为用户提供了完全的自由,即可以从原始人工自由版本或对偶人工自由版本开始,而无需对LP结构进行任何重新表述。最后但同样重要的是,它为那些希望在教授最优性实现之前将可行性实现作为一个单独主题进行教学的教师提供了一种教学辅助工具。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/b0a7efec2081/pone.0116156.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/b6f7c394631a/pone.0116156.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/ea8f0959b082/pone.0116156.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/570cf1751b7f/pone.0116156.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/05850e7edb75/pone.0116156.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/7745dee79664/pone.0116156.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/3f627f4ce791/pone.0116156.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/d8d7d642c5e7/pone.0116156.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/019e703f0ae3/pone.0116156.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/1d65fd1d6f96/pone.0116156.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/b0a7efec2081/pone.0116156.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/b6f7c394631a/pone.0116156.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/ea8f0959b082/pone.0116156.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/570cf1751b7f/pone.0116156.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/05850e7edb75/pone.0116156.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/7745dee79664/pone.0116156.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/3f627f4ce791/pone.0116156.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/d8d7d642c5e7/pone.0116156.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/019e703f0ae3/pone.0116156.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/1d65fd1d6f96/pone.0116156.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/852c/4358952/b0a7efec2081/pone.0116156.g010.jpg

相似文献

1
A streamlined artificial variable free version of simplex method.一种简化的无人工变量的单纯形法版本。
PLoS One. 2015 Mar 13;10(3):e0116156. doi: 10.1371/journal.pone.0116156. eCollection 2015.
2
Primal/dual linear programming and statistical atlases for cartilage segmentation.用于软骨分割的原始/对偶线性规划与统计图谱
Med Image Comput Comput Assist Interv. 2007;10(Pt 2):536-43. doi: 10.1007/978-3-540-75759-7_65.
3
Constructing sequence alignments from a Markov decision model with estimated parameter values.利用估计的参数值从马尔可夫决策模型构建序列比对。
Appl Bioinformatics. 2004;3(2-3):159-65. doi: 10.2165/00822942-200403020-00010.
4
A new non-monotonic infeasible simplex-type algorithm for Linear Programming.一种用于线性规划的新型非单调不可行单纯形类算法。
PeerJ Comput Sci. 2020 Mar 30;6:e265. doi: 10.7717/peerj-cs.265. eCollection 2020.
5
Conic sampling: an efficient method for solving linear and quadratic programming by randomly linking constraints within the interior.锥化抽样:通过在内部随机连接约束来有效解决线性和二次规划问题的方法。
PLoS One. 2012;7(8):e43706. doi: 10.1371/journal.pone.0043706. Epub 2012 Aug 27.
6
A unified quadratic-programming-based dynamical system approach to joint torque optimization of physically constrained redundant manipulators.一种基于统一二次规划的动力学系统方法用于物理约束冗余机械手的关节扭矩优化。
IEEE Trans Syst Man Cybern B Cybern. 2004 Oct;34(5):2126-32. doi: 10.1109/tsmcb.2004.830347.
7
Robust regularized kernel regression.稳健正则化核回归
IEEE Trans Syst Man Cybern B Cybern. 2008 Dec;38(6):1639-44. doi: 10.1109/TSMCB.2008.927279.
8
Training Lp norm multiple kernel learning in the primal.在原语中训练 Lp 范数多核学习。
Neural Netw. 2013 Oct;46:172-82. doi: 10.1016/j.neunet.2013.05.003. Epub 2013 May 24.
9
Global convergence of decomposition learning methods for support vector machines.支持向量机分解学习方法的全局收敛性
IEEE Trans Neural Netw. 2006 Nov;17(6):1362-9. doi: 10.1109/TNN.2006.880584.
10
Object matching using a locally affine invariant and linear programming techniques.基于局部仿射不变性和线性规划技术的目标匹配。
IEEE Trans Pattern Anal Mach Intell. 2013 Feb;35(2):411-24. doi: 10.1109/TPAMI.2012.99.

本文引用的文献

1
Human language reveals a universal positivity bias.人类语言显示出一种普遍的积极偏向。
Proc Natl Acad Sci U S A. 2015 Feb 24;112(8):2389-94. doi: 10.1073/pnas.1411678112. Epub 2015 Feb 9.
2
Robust flux balance analysis of multiscale biochemical reaction networks.多尺度生化反应网络的鲁棒通量平衡分析。
BMC Bioinformatics. 2013 Jul 30;14:240. doi: 10.1186/1471-2105-14-240.
3
Conic sampling: an efficient method for solving linear and quadratic programming by randomly linking constraints within the interior.锥化抽样:通过在内部随机连接约束来有效解决线性和二次规划问题的方法。
PLoS One. 2012;7(8):e43706. doi: 10.1371/journal.pone.0043706. Epub 2012 Aug 27.
4
The use of modified simplex method to optimize the room temperature phosphorescence variables in the determination of an antihypertensive drug.采用改进单纯形法优化抗高血压药物测定中的室温磷光变量。
Talanta. 2002 Jun 10;57(4):795-805. doi: 10.1016/s0039-9140(02)00105-4.
5
Application of the sequential simplex method in designing drug analogs.序贯单纯形法在药物类似物设计中的应用。
J Med Chem. 1974 Aug;17(8):799-804. doi: 10.1021/jm00254a004.