Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach

Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach

An attempt has been made to give an insight into the dual method which can be best represented for decision making in goal programming under an assumption of a preemptive priority structured approach. This model has been used to apply it to a transportation framework with deterministic constraints.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization 1989-01, Vol.20 (3), p.325-334
Hauptverfasser: Nayak, N.N., Basu, M., Tripathy, P.K.
Format: Artikel
Sprache:eng
Schlagworte:
deterministic constraints
Goal programming
iteration
preemptive priority
Primary:90C30
prioritized dual
transportation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 334
container_issue 3
container_start_page 325
container_title Optimization
container_volume 20
creator Nayak, N.N.
Basu, M.
Tripathy, P.K.
description An attempt has been made to give an insight into the dual method which can be best represented for decision making in goal programming under an assumption of a preemptive priority structured approach. This model has been used to apply it to a transportation framework with deterministic constraints.
doi_str_mv 10.1080/02331938908843450
format Article
fullrecord <record><control><sourceid>crossref_infor</sourceid><recordid>TN_cdi_crossref_primary_10_1080_02331938908843450</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1080_02331938908843450</sourcerecordid><originalsourceid>FETCH-LOGICAL-c165t-585f0de06bdadfd077ac533e311cb2940401fd4ccf03f18eccd79e30b746e1bc3</originalsourceid><addsrcrecordid>eNp1kE1OwzAQhS0EEuXnAOx8gcA4dtJEYoMq_qRK3cA6cuxxa5TEwXZAOQnXxaXsEKsZ6b3vzegRcsXgmkEFN5Bzzmpe1VBVgosCjsiCQV5nohbFMVns9SwZxCk5C-ENIGdlLhbkazNG28uOBtdN0bqBOkMl1RjR93awIVpFo5dDGJ2P8scxetd22NN2pnGHVE-ys3GmdqBbl5KSvPWyT_SWRlS7wb5PSKdBo0_Jo0fs080PTKt1fk-G6CcVJ4-ayjHhUu0uyImRXcDL33lOXh_uX1ZP2Xrz-Ly6W2eKlUXMiqowoBHKVkttNCyXUhWcI2dMtXktQAAzWihlgBtWoVJ6WSOHdilKZK3i54QdcpV3IXg0Tfqql35uGDT7Zps_zSbm9sDYwTjfy0_nO91EOXfOm1SVsqHh_-PfXguEZQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach</title><source>Taylor &amp; Francis</source><creator>Nayak, N.N. ; Basu, M. ; Tripathy, P.K.</creator><creatorcontrib>Nayak, N.N. ; Basu, M. ; Tripathy, P.K.</creatorcontrib><description>An attempt has been made to give an insight into the dual method which can be best represented for decision making in goal programming under an assumption of a preemptive priority structured approach. This model has been used to apply it to a transportation framework with deterministic constraints.</description><identifier>ISSN: 0233-1934</identifier><identifier>EISSN: 1029-4945</identifier><identifier>DOI: 10.1080/02331938908843450</identifier><language>eng</language><publisher>Akademic-Verlag</publisher><subject>deterministic constraints ; Goal programming ; iteration ; preemptive priority ; Primary:90C30 ; prioritized dual ; transportation</subject><ispartof>Optimization, 1989-01, Vol.20 (3), p.325-334</ispartof><rights>Copyright Taylor &amp; Francis Group, LLC 1989</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c165t-585f0de06bdadfd077ac533e311cb2940401fd4ccf03f18eccd79e30b746e1bc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/02331938908843450$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/02331938908843450$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,59620,60409</link.rule.ids></links><search><creatorcontrib>Nayak, N.N.</creatorcontrib><creatorcontrib>Basu, M.</creatorcontrib><creatorcontrib>Tripathy, P.K.</creatorcontrib><title>Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach</title><title>Optimization</title><description>An attempt has been made to give an insight into the dual method which can be best represented for decision making in goal programming under an assumption of a preemptive priority structured approach. This model has been used to apply it to a transportation framework with deterministic constraints.</description><subject>deterministic constraints</subject><subject>Goal programming</subject><subject>iteration</subject><subject>preemptive priority</subject><subject>Primary:90C30</subject><subject>prioritized dual</subject><subject>transportation</subject><issn>0233-1934</issn><issn>1029-4945</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNp1kE1OwzAQhS0EEuXnAOx8gcA4dtJEYoMq_qRK3cA6cuxxa5TEwXZAOQnXxaXsEKsZ6b3vzegRcsXgmkEFN5Bzzmpe1VBVgosCjsiCQV5nohbFMVns9SwZxCk5C-ENIGdlLhbkazNG28uOBtdN0bqBOkMl1RjR93awIVpFo5dDGJ2P8scxetd22NN2pnGHVE-ys3GmdqBbl5KSvPWyT_SWRlS7wb5PSKdBo0_Jo0fs080PTKt1fk-G6CcVJ4-ayjHhUu0uyImRXcDL33lOXh_uX1ZP2Xrz-Ly6W2eKlUXMiqowoBHKVkttNCyXUhWcI2dMtXktQAAzWihlgBtWoVJ6WSOHdilKZK3i54QdcpV3IXg0Tfqql35uGDT7Zps_zSbm9sDYwTjfy0_nO91EOXfOm1SVsqHh_-PfXguEZQ</recordid><startdate>19890101</startdate><enddate>19890101</enddate><creator>Nayak, N.N.</creator><creator>Basu, M.</creator><creator>Tripathy, P.K.</creator><general>Akademic-Verlag</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19890101</creationdate><title>Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach</title><author>Nayak, N.N. ; Basu, M. ; Tripathy, P.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c165t-585f0de06bdadfd077ac533e311cb2940401fd4ccf03f18eccd79e30b746e1bc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>deterministic constraints</topic><topic>Goal programming</topic><topic>iteration</topic><topic>preemptive priority</topic><topic>Primary:90C30</topic><topic>prioritized dual</topic><topic>transportation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nayak, N.N.</creatorcontrib><creatorcontrib>Basu, M.</creatorcontrib><creatorcontrib>Tripathy, P.K.</creatorcontrib><collection>CrossRef</collection><jtitle>Optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nayak, N.N.</au><au>Basu, M.</au><au>Tripathy, P.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach</atitle><jtitle>Optimization</jtitle><date>1989-01-01</date><risdate>1989</risdate><volume>20</volume><issue>3</issue><spage>325</spage><epage>334</epage><pages>325-334</pages><issn>0233-1934</issn><eissn>1029-4945</eissn><abstract>An attempt has been made to give an insight into the dual method which can be best represented for decision making in goal programming under an assumption of a preemptive priority structured approach. This model has been used to apply it to a transportation framework with deterministic constraints.</abstract><pub>Akademic-Verlag</pub><doi>10.1080/02331938908843450</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0233-1934
ispartof Optimization, 1989-01, Vol.20 (3), p.325-334
issn 0233-1934
1029-4945
language eng
recordid cdi_crossref_primary_10_1080_02331938908843450
source Taylor & Francis
subjects deterministic constraints
Goal programming
iteration
preemptive priority
Primary:90C30
prioritized dual
transportation
title Optimal solution of a deterministic transportation problem by the duality in goal programming technique under a preemptive priority structured approach
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T22%3A45%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20solution%20of%20a%20deterministic%20transportation%20problem%20by%20the%20duality%20in%20goal%20programming%20technique%20under%20a%20preemptive%20priority%20structured%20approach&rft.jtitle=Optimization&rft.au=Nayak,%20N.N.&rft.date=1989-01-01&rft.volume=20&rft.issue=3&rft.spage=325&rft.epage=334&rft.pages=325-334&rft.issn=0233-1934&rft.eissn=1029-4945&rft_id=info:doi/10.1080/02331938908843450&rft_dat=%3Ccrossref_infor%3E10_1080_02331938908843450%3C/crossref_infor%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