東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Maximum path return method.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Maximum path return method./
作者:	Wan, Shao-hong.
面頁冊數:	1 online resource (107 pages)
附註:	Source: Dissertations Abstracts International, Volume: 50-07, Section: B.
Contained By:	Dissertations Abstracts International50-07B.
標題:	Systems design. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=8815052click for full text (PQDT)
ISBN:	9798206733495

Maximum path return method.
Wan, Shao-hong.

Maximum path return method. - 1 online resource (107 pages)

Source: Dissertations Abstracts International, Volume: 50-07, Section: B.

Thesis (Ph.D.)--Stanford University, 1988.

Includes bibliographical references

The spatial market model studied in this dissertation consists of a network of interconnected regional markets for a single commodity. Each market is characterized by classic supply and demand functions. Shipping cost is incurred when inter-regional transportation takes place. Capacity constraints are imposed on both the regional productions and the flows on shipping routes. The problem is to find the equilibrium of this model. For policy analysis in many application areas, it is necessary to solve moderate to large-scale spatial equilibrium problems. Past work on this problem has been directed mainly towards solving its dual mathematical programming problem in a continuous form. In this dissertation, however, we focus on the discrete version of the spatial equilibrium problem. The motivation of this work is to develop a new direct method for solving the discrete spatial equilibrium problem that exploits the problem's underlying economic and network structure. A major result of this work is the determination of a polynomial bound for the new method--the maximum path return method (the MPR method)--to solve spatial equilibrium problems when the inter-regional shipping costs are linear. The principle of the MPR method is a greedy incremental trading mechanism. At each iteration, a unit of the commodity is sent from a chosen selling region to a chosen buying region along a path of minimum shipping cost to realize the maximum marginal trade profit in the network. The most significant property of this simple method is that in the iterative process of successive trade, a region that imports a unit will never export, and a region that exports a unit will never import. All the commodities are sent from one subset of regions to another subset of regions. This monotonic property is critical to both the theoretical computational analysis and the practical computational efficiency. A broad class of large-scale discrete spatial equilibrium problems, including "on-line" commodity trading problems in decentralized economic organizations such as power pools and inter-temporal spatial equilibrium problems, can be effectively solved by the polynomial-time scaling maximum path return method developed in this dissertation. (Abstract shortened with permission of author.).

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798206733495Subjects--Topical Terms:

3433840
Systems design.
Index Terms--Genre/Form:

542853
Electronic books.

Maximum path return method.
LDR:03462nmm a2200325K 4500 001 2357976
005 20230725053826.5
006 m o d
007 cr mn ---uuuuu
008 241011s1988 xx obm 000 0 eng d
020 $a 9798206733495
035 $a (MiAaPQ)AAI8815052
035 $a AAI8815052
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Wan, Shao-hong. $3 3698508
245 1 0 $a Maximum path return method.
264 0 $c 1988
300 $a 1 online resource (107 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 50-07, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Luenberger, David G.
502 $a Thesis (Ph.D.)--Stanford University, 1988.
504 $a Includes bibliographical references
520 $a The spatial market model studied in this dissertation consists of a network of interconnected regional markets for a single commodity. Each market is characterized by classic supply and demand functions. Shipping cost is incurred when inter-regional transportation takes place. Capacity constraints are imposed on both the regional productions and the flows on shipping routes. The problem is to find the equilibrium of this model. For policy analysis in many application areas, it is necessary to solve moderate to large-scale spatial equilibrium problems. Past work on this problem has been directed mainly towards solving its dual mathematical programming problem in a continuous form. In this dissertation, however, we focus on the discrete version of the spatial equilibrium problem. The motivation of this work is to develop a new direct method for solving the discrete spatial equilibrium problem that exploits the problem's underlying economic and network structure. A major result of this work is the determination of a polynomial bound for the new method--the maximum path return method (the MPR method)--to solve spatial equilibrium problems when the inter-regional shipping costs are linear. The principle of the MPR method is a greedy incremental trading mechanism. At each iteration, a unit of the commodity is sent from a chosen selling region to a chosen buying region along a path of minimum shipping cost to realize the maximum marginal trade profit in the network. The most significant property of this simple method is that in the iterative process of successive trade, a region that imports a unit will never export, and a region that exports a unit will never import. All the commodities are sent from one subset of regions to another subset of regions. This monotonic property is critical to both the theoretical computational analysis and the practical computational efficiency. A broad class of large-scale discrete spatial equilibrium problems, including "on-line" commodity trading problems in decentralized economic organizations such as power pools and inter-temporal spatial equilibrium problems, can be effectively solved by the polynomial-time scaling maximum path return method developed in this dissertation. (Abstract shortened with permission of author.).
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Systems design. $3 3433840
650 4 $a Systems science. $3 3168411
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0790
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 50-07B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=8815052 $z click for full text (PQDT)