The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling: Large scale nonconvex optimization algorithms and applications

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2004, Vol.100 (1), p.133-150
Hauptverfasser:	HALL, J. A. J, MCKINNON, K. I. M
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	150
container_issue	1
container_start_page	133
container_title	Mathematical programming
container_volume	100
creator	HALL, J. A. J MCKINNON, K. I. M
description
format	Article
fullrecord	<record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_15718044</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>15718044</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_157180443</originalsourceid><addsrcrecordid>eNqNi70OgjAURhujifjzDndxJGmlIKtRjJNxcHAjTblICRTSNgpvrxJ1dvpOcs43Ih7jQeTziEdj4lG6Dv0wYnRKZtaWlFIWxLFHykuBYFXdVmgdYCcGgkeBBsH9XAc1uqLJQPby7YV-YaMz5VSjv3lyPW9Pe8iFqiy4BlqDd9Ru-Ch9W5BJLiqLy8_OyeqQXHZHvxVWiio3Qktl09aoWpg-ZeGGxZTz4N_uCWb3S9w</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling: Large scale nonconvex optimization algorithms and applications</title><source>SpringerLink Journals</source><source>Business Source Complete</source><creator>HALL, J. A. J ; MCKINNON, K. I. M</creator><creatorcontrib>HALL, J. A. J ; MCKINNON, K. I. M</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>CODEN: MHPGA4</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Mathematical programming, 2004, Vol.100 (1), p.133-150</ispartof><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15718044$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>HALL, J. A. J</creatorcontrib><creatorcontrib>MCKINNON, K. I. M</creatorcontrib><title>The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling: Large scale nonconvex optimization algorithms and applications</title><title>Mathematical programming</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0025-5610</issn><issn>1436-4646</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNqNi70OgjAURhujifjzDndxJGmlIKtRjJNxcHAjTblICRTSNgpvrxJ1dvpOcs43Ih7jQeTziEdj4lG6Dv0wYnRKZtaWlFIWxLFHykuBYFXdVmgdYCcGgkeBBsH9XAc1uqLJQPby7YV-YaMz5VSjv3lyPW9Pe8iFqiy4BlqDd9Ru-Ch9W5BJLiqLy8_OyeqQXHZHvxVWiio3Qktl09aoWpg-ZeGGxZTz4N_uCWb3S9w</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>HALL, J. A. J</creator><creator>MCKINNON, K. I. M</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling</title><author>HALL, J. A. J ; MCKINNON, K. I. M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_157180443</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>HALL, J. A. J</creatorcontrib><creatorcontrib>MCKINNON, K. I. M</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>HALL, J. A. J</au><au>MCKINNON, K. I. M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling: Large scale nonconvex optimization algorithms and applications</atitle><jtitle>Mathematical programming</jtitle><date>2004</date><risdate>2004</risdate><volume>100</volume><issue>1</issue><spage>133</spage><epage>150</epage><pages>133-150</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><coden>MHPGA4</coden><cop>Heidelberg</cop><pub>Springer</pub></addata></record>
fulltext	fulltext
identifier	ISSN: 0025-5610
ispartof	Mathematical programming, 2004, Vol.100 (1), p.133-150
issn	0025-5610 1436-4646
language	eng
recordid	cdi_pascalfrancis_primary_15718044
source	SpringerLink Journals; Business Source Complete
subjects	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science
title	The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling: Large scale nonconvex optimization algorithms and applications
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T05%3A53%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20simplest%20examples%20where%20the%20simplex%20method%20cycles%20and%20conditions%20where%20EXPAND%20fails%20to%20prevent%20cycling:%20Large%20scale%20nonconvex%20optimization%20algorithms%20and%20applications&rft.jtitle=Mathematical%20programming&rft.au=HALL,%20J.%20A.%20J&rft.date=2004&rft.volume=100&rft.issue=1&rft.spage=133&rft.epage=150&rft.pages=133-150&rft.issn=0025-5610&rft.eissn=1436-4646&rft.coden=MHPGA4&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E15718044%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true