A RECURRENCE METHOD FOR SIMPLE CONTINUOUS LINEAR PROGRAMMING PROBLEMS

In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the Chinese Institute of Industrial Engineers Jg. 26; H. 2; S. 147 - 155
Hauptverfasser: Wen, Ching-Feng, Wu, Yan-Kuen, Lur, Yung-Yih
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis Group 01.01.2009
Schlagworte:
continuous linear programming problems
recurrence method
ISSN:1017-0669, 2151-7606
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing an approximate optimal value in the provided method is only to solve finite linear programming problems by using recurrence relations. Furthermore, a simple algorithm can be employed not only to easily solve the (SP) problem but also to provide an error bound of optimal value as well. Some numerical examples are given to implement the algorithm.
AbstractList In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing an approximate optimal value in the provided method is only to solve finite linear programming problems by using recurrence relations. Furthermore, a simple algorithm can be employed not only to easily solve the (SP) problem but also to provide an error bound of optimal value as well. Some numerical examples are given to implement the algorithm.
Author Wen, Ching-Feng
Wu, Yan-Kuen
Lur, Yung-Yih
Author_xml – sequence: 1
  givenname: Ching-Feng
  surname: Wen
  fullname: Wen, Ching-Feng
  organization: General Education Center , Kaohsiung Medical University
– sequence: 2
  givenname: Yan-Kuen
  surname: Wu
  fullname: Wu, Yan-Kuen
  organization: Department of Industrial Management , Vanung University
– sequence: 3
  givenname: Yung-Yih
  surname: Lur
  fullname: Lur, Yung-Yih
  organization: Department of Industrial Management , Vanung University
BookMark eNqF0N9qgzAUBvAwOljX9QF25wu45RgTDezGubQV_FNsvZZoEhBaHVHY-vZr6e4K29U5cL7fufge0awfeo3QM-AXwCF-BQwBZgxzzCnmQOAOzT2g4AYMsxmaX-7uOcAf0HIcuwYDC3xMMZ0jETmliKuyFHksnEzsN8WHsypKZ5dk21Q4cZHvk7wqqp2TJrmISmdbFusyyrIkX1_291Rkuyd0b-Rh1MvfuUDVSuzjjZsW6ySOUrf1gEyu9puAKt-EXLeGUwAvUL6HQ6k4NJ5vGtOQQGlPSW40Y4QpSTTV4BEeUsUbskBw_dvaYRytNvWn7Y7SnmrA9aWK-qaKs3m7mq43gz3Kr8EeVD3J02Gwxsq-7caa_MWDf_mNqqfvifwAIV1xsQ
Cites_doi 10.1137/S0363012993247858
10.1016/0022-247X(69)90106-1
10.1080/00207728108963831
10.1006/jmaa.1997.5279
10.1137/0115112
10.1137/0113043
10.1016/0022-247X(66)90187-9
10.1007/BF01956855
10.1007/s10107-002-0307-0
10.1137/0331073
10.1002/net.3230190403
10.1137/S0363012993257507
10.1287/moor.1050.0166
10.1080/13873959708837058
10.1007/BF01303432
10.1137/S1052623494278827
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2009
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2009
DBID AAYXX
CITATION
DOI 10.1080/10170660909509131
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2151-7606
EndPage 155
ExternalDocumentID 10_1080_10170660909509131
9509131
GroupedDBID .7F
.QJ
0BK
4.4
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACTIO
ADCVX
ADGTB
ADUMR
AFRVT
AGBKS
AGDLA
AGMYJ
AIJEM
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
BLEHA
CCCUG
CE4
DGEBU
DKSSO
EBS
EJD
ESX
E~A
E~B
H13
KYCEM
M4Z
NA5
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
TUS
UT5
UU3
ZGOLN
~S~
AAYXX
ABDBF
ACTTO
ACUHS
AFBWG
AFION
AGVKY
AGWUF
ALRRR
CITATION
CYRSC
DAOYK
HF~
I-F
IPNFZ
MK~
OPCYK
RIG
ID FETCH-LOGICAL-c213t-e4b75d4f89ecf951127d4208ad91b24fbfb37de2da9fe6636da3e5e123985d9b3
IEDL.DBID TFW
ISSN 1017-0669
IngestDate Sat Nov 29 02:35:04 EST 2025
Mon Oct 20 23:30:48 EDT 2025
Mon May 13 12:09:35 EDT 2019
IsPeerReviewed false
IsScholarly false
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c213t-e4b75d4f89ecf951127d4208ad91b24fbfb37de2da9fe6636da3e5e123985d9b3
PageCount 9
ParticipantIDs crossref_primary_10_1080_10170660909509131
informaworld_taylorfrancis_310_1080_10170660909509131
PublicationCentury 2000
PublicationDate 1/1/2009
2009-01-00
PublicationDateYYYYMMDD 2009-01-01
PublicationDate_xml – month: 01
  year: 2009
  text: 1/1/2009
  day: 01
PublicationDecade 2000
PublicationTitle Journal of the Chinese Institute of Industrial Engineers
PublicationYear 2009
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References CIT0012
Drews W. P. (CIT0010) 1974
CIT0011
Segers R. G. (CIT0024) 1974
Bellman R. (CIT0008) 1957
CIT0015
CIT0018
CIT0017
CIT0019
Anderson E. J. (CIT0001) 1978
CIT0021
CIT0020
CIT0023
Lehman R. S. (CIT0016) 1954
CIT0022
Bellman R. (CIT0007) 1953; 39
Hartberger R. J. (CIT0014) 1974
Buie R. N. (CIT0009) 1973; 17
Grinold R. C. (CIT0013) 1970; 18
Anderson E. J. (CIT0003) 1987
Wang X. (CIT0027) 2005
CIT0025
CIT0002
CIT0005
CIT0004
CIT0026
CIT0006
References_xml – ident: CIT0019
  doi: 10.1137/S0363012993247858
– volume: 39
  start-page: 947
  volume-title: Proceedings of the National Academy of Sciences of the United States of America
  year: 1953
  ident: CIT0007
– ident: CIT0012
  doi: 10.1016/0022-247X(69)90106-1
– ident: CIT0002
  doi: 10.1080/00207728108963831
– start-page: 297
  volume-title: Optimization Methods for Resource Allocation
  year: 1974
  ident: CIT0014
– ident: CIT0015
  doi: 10.1006/jmaa.1997.5279
– volume-title: Theory and Algorithms for Separated Continuous Linear Programming and Its Extensions
  year: 2005
  ident: CIT0027
– ident: CIT0026
  doi: 10.1137/0115112
– ident: CIT0025
  doi: 10.1137/0113043
– volume-title: A Continuous Model for Job-shop Scheduling
  year: 1978
  ident: CIT0001
– start-page: 309
  volume-title: Optimization Methods for Resource Allocation
  year: 1974
  ident: CIT0010
– ident: CIT0017
  doi: 10.1016/0022-247X(66)90187-9
– volume: 17
  start-page: 107
  year: 1973
  ident: CIT0009
  publication-title: Mathematical Methods of Operations Research
  doi: 10.1007/BF01956855
– ident: CIT0023
  doi: 10.1007/s10107-002-0307-0
– ident: CIT0018
  doi: 10.1137/0331073
– volume: 18
  start-page: 84
  year: 1970
  ident: CIT0013
  publication-title: Solving Scientific Problems with Mathematical Methods
– ident: CIT0004
  doi: 10.1002/net.3230190403
– volume-title: Linear Programming in Infinite Dimensional Spaces
  year: 1987
  ident: CIT0003
– ident: CIT0020
  doi: 10.1137/S0363012993257507
– volume-title: On the Continuous Simplex Method
  year: 1954
  ident: CIT0016
– start-page: 279
  volume-title: Optimization Methods for Resource Allocation
  year: 1974
  ident: CIT0024
– ident: CIT0011
  doi: 10.1287/moor.1050.0166
– ident: CIT0021
  doi: 10.1080/13873959708837058
– ident: CIT0006
  doi: 10.1007/BF01303432
– ident: CIT0022
  doi: 10.1137/S1052623494278827
– volume-title: Dynamic Programming
  year: 1957
  ident: CIT0008
– ident: CIT0005
  doi: 10.1002/net.3230190403
SSID ssib016740505
ssib045028916
ssib007296312
ssib002258420
ssib054444800
ssib005906602
ssj0000329058
ssib029915108
ssib017350519
Score 1.4098854
Snippet In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A...
SourceID crossref
informaworld
SourceType Index Database
Enrichment Source
Publisher
StartPage 147
SubjectTerms continuous linear programming problems
recurrence method
Title A RECURRENCE METHOD FOR SIMPLE CONTINUOUS LINEAR PROGRAMMING PROBLEMS
URI https://www.tandfonline.com/doi/abs/10.1080/10170660909509131
Volume 26
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 2151-7606
  dateEnd: 20121231
  omitProxy: false
  ssIdentifier: ssj0000329058
  issn: 1017-0669
  databaseCode: TFW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELYQYoCBN6K85IEJKaKO4zoeS0mhUpNWaSvYKju2JZaCaED8fHxJSoN4DJAplmJFOV38fee7-4zQOc-I1CY0njU6dAEKDTwR6pbHpaXG14rrrGgU7vMkCe_vxbCqzZlXZZUQQ9tSKKJYq-Hnlmq-qIi7JIXmS6spHD0AWUsIfhyrB_8ed-9q4OTAtUaGmIBJtS5K3znfEtyhHB-OdfsYc8qA3yzGbt126LhUwgkYJOmW5IoF7gorsbsCB6gvmqzsxSNQY9YSi7Tqdx_xCRg_yabWAK-79U9TbaPNiunidumaO2jFzHbRRk3_cA9FbZxGnUmawj4XjqPx7eAau7AUj3rxsB_hziAZ95LJYDLC_V4StVM8TAc3aTuOe8kN3F_1o3i0jybdaNy59apzHbzMJzT3TKA404ENhcmsAMbHNWT5pRZE-YFVVlGunadIYY1jRC0tqWGGgFQh00LRA7Q6e5yZQ4Sti79kRjSTSgUiICoUXCvGjO83rZCqgS4WRp0-lfIdU1Kpon6xTQM162af5sWeiS0POPn6-DR_yxuI_TKF_viqoz_OO0brZToL9oBO0Gr-_GJO0Vr2mj_Mn88K_38HIpruVw
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT9swGLYQILEdgLEhyqcPOyFFq-O4jo-lpLQiSas01bhFcWxLXAqCbNrPx2-S0iBgB8gplmxFeWX7ed4PP0boJy9IrrSvHaOVbx0U6jnCVz2H54ZqV0muiuqgcMjj2L-5EdMm4PbYlFWCD21qoYhqr4bFDcHoZUncL1KJvvS6wvID0LW03s8GszgLJX3p8HcLniy8tugQEzCqdY7StdNvBe9QkA8Xuz23OWXAcJZtu3NbfFxp4XgM0nQresU8-_iN3F2FBNQVXVafxiNQZdYTy8TqW3_xAhpfCKe2IG-481lj7aLthuzifj07v6E1vdhDX1sSiN9R0MdJMJgnCYS6cBSko8kltp4pno2jaRjgwSROx_F8Mp_hcBwH_QRPk8lV0o-icXwF7xdhEM1-oPkwSAcjp7nawSlcQktHe5Iz5Rlf6MIIIH1cQaI_V4JI1zPSSMqVnSy5MNqSop7KqWaagFohU0LSfbS-uFvoA4SNdcHygiiWS-kJj0hfcCUZ067bNSKXHXS-tGp2Xyt4ZKQRRn1lmw7qtu2elVXYxNR3nLzunpX_yg5i_xlC3_3U4QfHnaGtURqFmTX69RH6Ume3ICR0jNbLhz_6BG0Wf8vbx4fTajE8AU9Q8ng
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFA4yRfTgb3H-zMGTUFyapmmOc-vmcO1Gt6G30jQJeJlDq_jnm7Sdq0w9aE8NJJQ-XvJ9L-_lCwCXNEWJkJ60lBSeDlCwYzFPuBZNFJa24FSk-UHhPg1D7-GBDcvanJeyrNLE0KoQisjXajO5Z0LNK-KuUa754jaYpgdG1lIHP6u5MJZ253HnvoJOGl0rbIgwM6pyjNLW3rdAd1OPb-51-2xTTAzBmbf1wq3hcSGF4xCTpVuwK-LoxyvV7nIgwDZrkOIwHjJFZi6b51W_-4svyPhFN7WCeJ3tf9pqB2yVVBc2C9_cBStyugc2KwKI-8BvwshvTaLIbHTBwB_fDtpQx6Vw1AuGfR-2BuG4F04GkxHs90K_GcFhNOhGzSDohV3zftP3g9EBmHT8cevWKi92sFIb4cySDqdEOMpjMlXMUD4qTJo_EQxx21FccUyFdpWEKakpkSsSLIlERquQCMbxIahNn6byCEClA7AkRYIknDvMQdxjVHBCpG03FEt4HVzNjRrPCv2OGJWyqEu2qYNG1exxlm-aqOKGk-Xucfae1QH5ZQj-8VPHfxx3AdaH7U6sbX53AjaK1JbZDzoFtez5VZ6BtfQte3x5Ps-nwgc4KfEc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+RECURRENCE+METHOD+FOR+SIMPLE+CONTINUOUS+LINEAR+PROGRAMMING+PROBLEMS&rft.jtitle=Journal+of+the+Chinese+Institute+of+Industrial+Engineers&rft.au=Wen%2C+Ching-Feng&rft.au=Wu%2C+Yan-Kuen&rft.au=Lur%2C+Yung-Yih&rft.date=2009-01-01&rft.issn=1017-0669&rft.eissn=2151-7606&rft.volume=26&rft.issue=2&rft.spage=147&rft.epage=155&rft_id=info:doi/10.1080%2F10170660909509131&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_10170660909509131
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1017-0669&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1017-0669&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1017-0669&client=summon