SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS
The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Report |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Brooks,Robin B. S |
| description | The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers. |
| format | Report |
| fullrecord | <record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_AD0658823</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>AD0658823</sourcerecordid><originalsourceid>FETCH-dtic_stinet_AD06588233</originalsourceid><addsrcrecordid>eNrjZLAM9vd1VfDx9HN1DFIICPJ3D3L09fX0c1dwDAjw8XR2DPH09wtWCPFXCA7xd_Z2dHcFKXLycfUN5mFgTUvMKU7lhdLcDDJuriHOHropJZnJ8cUlmXmpJfGOLgZmphYWRsbGBKQBDXwmCw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS</title><source>DTIC Technical Reports</source><creator>Brooks,Robin B. S</creator><creatorcontrib>Brooks,Robin B. S ; RAND CORP SANTA MONICA CALIF</creatorcontrib><description>The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers.</description><language>eng</language><subject>AIR FORCE EQUIPMENT ; ALGORITHMS ; APPROXIMATION(MATHEMATICS) ; COST EFFECTIVENESS ; DECISION MAKING ; Economics and Cost Analysis ; INVENTORY CONTROL ; LINEAR PROGRAMMING ; Logistics, Military Facilities and Supplies ; MAINTENANCE ; MANAGEMENT PLANNING AND CONTROL ; Operations Research ; OPTIMIZATION ; SIMPLEX METHOD</subject><creationdate>1967</creationdate><rights>APPROVED FOR PUBLIC RELEASE</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,27567,27568</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/AD0658823$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Brooks,Robin B. S</creatorcontrib><creatorcontrib>RAND CORP SANTA MONICA CALIF</creatorcontrib><title>SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS</title><description>The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers.</description><subject>AIR FORCE EQUIPMENT</subject><subject>ALGORITHMS</subject><subject>APPROXIMATION(MATHEMATICS)</subject><subject>COST EFFECTIVENESS</subject><subject>DECISION MAKING</subject><subject>Economics and Cost Analysis</subject><subject>INVENTORY CONTROL</subject><subject>LINEAR PROGRAMMING</subject><subject>Logistics, Military Facilities and Supplies</subject><subject>MAINTENANCE</subject><subject>MANAGEMENT PLANNING AND CONTROL</subject><subject>Operations Research</subject><subject>OPTIMIZATION</subject><subject>SIMPLEX METHOD</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>1967</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNrjZLAM9vd1VfDx9HN1DFIICPJ3D3L09fX0c1dwDAjw8XR2DPH09wtWCPFXCA7xd_Z2dHcFKXLycfUN5mFgTUvMKU7lhdLcDDJuriHOHropJZnJ8cUlmXmpJfGOLgZmphYWRsbGBKQBDXwmCw</recordid><startdate>196709</startdate><enddate>196709</enddate><creator>Brooks,Robin B. S</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>196709</creationdate><title>SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS</title><author>Brooks,Robin B. S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_AD06588233</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>1967</creationdate><topic>AIR FORCE EQUIPMENT</topic><topic>ALGORITHMS</topic><topic>APPROXIMATION(MATHEMATICS)</topic><topic>COST EFFECTIVENESS</topic><topic>DECISION MAKING</topic><topic>Economics and Cost Analysis</topic><topic>INVENTORY CONTROL</topic><topic>LINEAR PROGRAMMING</topic><topic>Logistics, Military Facilities and Supplies</topic><topic>MAINTENANCE</topic><topic>MANAGEMENT PLANNING AND CONTROL</topic><topic>Operations Research</topic><topic>OPTIMIZATION</topic><topic>SIMPLEX METHOD</topic><toplevel>online_resources</toplevel><creatorcontrib>Brooks,Robin B. S</creatorcontrib><creatorcontrib>RAND CORP SANTA MONICA CALIF</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Brooks,Robin B. S</au><aucorp>RAND CORP SANTA MONICA CALIF</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS</btitle><date>1967-09</date><risdate>1967</risdate><abstract>The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_dtic_stinet_AD0658823 |
| source | DTIC Technical Reports |
| subjects | AIR FORCE EQUIPMENT ALGORITHMS APPROXIMATION(MATHEMATICS) COST EFFECTIVENESS DECISION MAKING Economics and Cost Analysis INVENTORY CONTROL LINEAR PROGRAMMING Logistics, Military Facilities and Supplies MAINTENANCE MANAGEMENT PLANNING AND CONTROL Operations Research OPTIMIZATION SIMPLEX METHOD |
| title | SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T02%3A05%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=SOME%20LINEAR%20PROGRAMMING%20APPLICATIONS%20TO%20STOCKAGE%20PROBLEMS&rft.au=Brooks,Robin%20B.%20S&rft.aucorp=RAND%20CORP%20SANTA%20MONICA%20CALIF&rft.date=1967-09&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EAD0658823%3C/dtic_1RU%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 |