Problems of efficient application and development of a network under capital investments and credits
The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The orig...
Gespeichert in:
| Veröffentlicht in: | Journal of computer & systems sciences international 2007-12, Vol.46 (6), p.895-902 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 902 |
|---|---|
| container_issue | 6 |
| container_start_page | 895 |
| container_title | Journal of computer & systems sciences international |
| container_volume | 46 |
| creator | Grigor’ev, V. V. Dumbadze, L. G. Leonov, V. Yu |
| description | The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The original problem is reduced to a finite sequence of linear programming problems with the number of constraints lower by one order of magnitude and the number of variables up to several billions. The problems of the sequence are solved using the modified simplex method with generation of columns. The problems of maximization of profit of the owner of the upgraded network who leases channels are solved for limited capital investments and for the case of drawing up a credit, and the optimal amount of credit is determined. Solution algorithms based on the procedure of separation of variables are proposed. Numerical examples are presented.[PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1134/S1064230707060068 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_881080161</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2416988401</sourcerecordid><originalsourceid>FETCH-LOGICAL-c224t-3d65971321c11bb8b3a5c7575a5d788620eee136d43e824cd834350917132ea53</originalsourceid><addsrcrecordid>eNplkE9LxDAQxYMouK5-AG_BezXTNGn2KIv_YEFBPZc0mULWNqlJd8Vvb-p6kznMwPu9meERcgnsGoBXN6_AZFVyVueSjEl1RBYghCik4Ow4z1kuZv2UnKW0ZYyvJKsWxL7E0PY4JBo6il3njEM_UT2OvTN6csFT7S21uMc-jMOsZVBTj9NXiB905y1GavToJt1T5_eYpplKvzYT0bopnZOTTvcJL_76krzf372tH4vN88PT-nZTmLKspoJbKVY18BIMQNuqlmthalELLWytlCwZIgKXtuKoyspYxSsu2ApmD2rBl-TqsHeM4XOXP2m2YRd9PtkoBUwxkJAhOEAmhpQids0Y3aDjdwOsmbNs_mXJfwDRtWaJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>881080161</pqid></control><display><type>article</type><title>Problems of efficient application and development of a network under capital investments and credits</title><source>Springer Online Journals Complete</source><creator>Grigor’ev, V. V. ; Dumbadze, L. G. ; Leonov, V. Yu</creator><creatorcontrib>Grigor’ev, V. V. ; Dumbadze, L. G. ; Leonov, V. Yu</creatorcontrib><description>The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The original problem is reduced to a finite sequence of linear programming problems with the number of constraints lower by one order of magnitude and the number of variables up to several billions. The problems of the sequence are solved using the modified simplex method with generation of columns. The problems of maximization of profit of the owner of the upgraded network who leases channels are solved for limited capital investments and for the case of drawing up a credit, and the optimal amount of credit is determined. Solution algorithms based on the procedure of separation of variables are proposed. Numerical examples are presented.[PUBLICATION ABSTRACT]</description><identifier>ISSN: 1064-2307</identifier><identifier>EISSN: 1555-6530</identifier><identifier>DOI: 10.1134/S1064230707060068</identifier><language>eng</language><publisher>Silver Spring: Springer Nature B.V</publisher><subject>Algorithms ; Capital investments ; Communications networks ; Linear programming ; Simplex method ; Studies</subject><ispartof>Journal of computer & systems sciences international, 2007-12, Vol.46 (6), p.895-902</ispartof><rights>Nauka/Interperiodica 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c224t-3d65971321c11bb8b3a5c7575a5d788620eee136d43e824cd834350917132ea53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Grigor’ev, V. V.</creatorcontrib><creatorcontrib>Dumbadze, L. G.</creatorcontrib><creatorcontrib>Leonov, V. Yu</creatorcontrib><title>Problems of efficient application and development of a network under capital investments and credits</title><title>Journal of computer & systems sciences international</title><description>The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The original problem is reduced to a finite sequence of linear programming problems with the number of constraints lower by one order of magnitude and the number of variables up to several billions. The problems of the sequence are solved using the modified simplex method with generation of columns. The problems of maximization of profit of the owner of the upgraded network who leases channels are solved for limited capital investments and for the case of drawing up a credit, and the optimal amount of credit is determined. Solution algorithms based on the procedure of separation of variables are proposed. Numerical examples are presented.[PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Capital investments</subject><subject>Communications networks</subject><subject>Linear programming</subject><subject>Simplex method</subject><subject>Studies</subject><issn>1064-2307</issn><issn>1555-6530</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNplkE9LxDAQxYMouK5-AG_BezXTNGn2KIv_YEFBPZc0mULWNqlJd8Vvb-p6kznMwPu9meERcgnsGoBXN6_AZFVyVueSjEl1RBYghCik4Ow4z1kuZv2UnKW0ZYyvJKsWxL7E0PY4JBo6il3njEM_UT2OvTN6csFT7S21uMc-jMOsZVBTj9NXiB905y1GavToJt1T5_eYpplKvzYT0bopnZOTTvcJL_76krzf372tH4vN88PT-nZTmLKspoJbKVY18BIMQNuqlmthalELLWytlCwZIgKXtuKoyspYxSsu2ApmD2rBl-TqsHeM4XOXP2m2YRd9PtkoBUwxkJAhOEAmhpQids0Y3aDjdwOsmbNs_mXJfwDRtWaJ</recordid><startdate>200712</startdate><enddate>200712</enddate><creator>Grigor’ev, V. V.</creator><creator>Dumbadze, L. G.</creator><creator>Leonov, V. Yu</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>200712</creationdate><title>Problems of efficient application and development of a network under capital investments and credits</title><author>Grigor’ev, V. V. ; Dumbadze, L. G. ; Leonov, V. Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c224t-3d65971321c11bb8b3a5c7575a5d788620eee136d43e824cd834350917132ea53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Capital investments</topic><topic>Communications networks</topic><topic>Linear programming</topic><topic>Simplex method</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Grigor’ev, V. V.</creatorcontrib><creatorcontrib>Dumbadze, L. G.</creatorcontrib><creatorcontrib>Leonov, V. Yu</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of computer & systems sciences international</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grigor’ev, V. V.</au><au>Dumbadze, L. G.</au><au>Leonov, V. Yu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Problems of efficient application and development of a network under capital investments and credits</atitle><jtitle>Journal of computer & systems sciences international</jtitle><date>2007-12</date><risdate>2007</risdate><volume>46</volume><issue>6</issue><spage>895</spage><epage>902</epage><pages>895-902</pages><issn>1064-2307</issn><eissn>1555-6530</eissn><abstract>The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The original problem is reduced to a finite sequence of linear programming problems with the number of constraints lower by one order of magnitude and the number of variables up to several billions. The problems of the sequence are solved using the modified simplex method with generation of columns. The problems of maximization of profit of the owner of the upgraded network who leases channels are solved for limited capital investments and for the case of drawing up a credit, and the optimal amount of credit is determined. Solution algorithms based on the procedure of separation of variables are proposed. Numerical examples are presented.[PUBLICATION ABSTRACT]</abstract><cop>Silver Spring</cop><pub>Springer Nature B.V</pub><doi>10.1134/S1064230707060068</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1064-2307 |
| ispartof | Journal of computer & systems sciences international, 2007-12, Vol.46 (6), p.895-902 |
| issn | 1064-2307 1555-6530 |
| language | eng |
| recordid | cdi_proquest_journals_881080161 |
| source | Springer Online Journals Complete |
| subjects | Algorithms Capital investments Communications networks Linear programming Simplex method Studies |
| title | Problems of efficient application and development of a network under capital investments and credits |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T18%3A35%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Problems%20of%20efficient%20application%20and%20development%20of%20a%20network%20under%20capital%20investments%20and%20credits&rft.jtitle=Journal%20of%20computer%20&%20systems%20sciences%20international&rft.au=Grigor%E2%80%99ev,%20V.%20V.&rft.date=2007-12&rft.volume=46&rft.issue=6&rft.spage=895&rft.epage=902&rft.pages=895-902&rft.issn=1064-2307&rft.eissn=1555-6530&rft_id=info:doi/10.1134/S1064230707060068&rft_dat=%3Cproquest_cross%3E2416988401%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=881080161&rft_id=info:pmid/&rfr_iscdi=true |