컨텐츠로 이동
Linear programs and related problems 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Linear programs and related problems

저자: Evar D Nering; Albert W Tucker
출판사: Boston : Academic Press, ©1993.
시리즈: Computer science and scientific computing.
판/형식:   도서 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

이 항목에 대한 링크

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Evar D Nering; Albert W Tucker
ISBN: 0125154402 9780125154406
OCLC 번호: 20259282
설명: xiv, 584 pages : illustrations ; 24 cm + 1 computer disc (color ; 5 1/4 in.).
세부사항: System requirements for computer disk: IBM PC or compatible; DOS.
내용: I. Linear Programs. 1. Sample Linear Programs. 1.1. A Production Problem. 1.2. A Diet Problem. 1.3. A Transportation Problem. 1.4. An Informal Algorithm. 1.5. Graphical Representation. 2. Tableau Algebra. 2.1. Tableaux and the Duality Equation. 2.2. Pivot Exchange, Row Equations. 2.3. Pivot Exchange, Column Equations. 2.4. Equivalent Tableaux. 2.5. Basic Solutions. 2.6. Inversion. 2.7. Block Pivots. 2.8. Expanded Tableaux. 3. Canonical Duality. 3.1. Canonical Dual Linear Programs. 3.2. Sufficient Conditions for Optimality. 3.3. Economic Interpretation of Duality. 3.4. Heuristic Pivoting. 3.5. Optimal Solutions --
Unique, Multiple, None. 3.6. The Geometric Picture. 3.7. Feasibility Algorithm. 3.8. Priority Pivoting. 4. The Simplex Algorithm. 4.1. The Simplex Algorithm. 4.2. Degeneracy and Cycling. 4.3. Bland's Anticycling Rule. 4.4. Theorems of the Two Alternatives. 4.5. The Dual Simplex Algorithm. 4.6. The Theorem of the Four Alternatives. 4.7. The Existence-Duality Theorem. 5. General Linear Programs. 5.1. General Dual Linear Programs. 5.2. Reduction to Canonical Form. 5.3. The Two-Phase Simplex Method. 5.4. Systems of Linear Inequalities. 5.5. Complementary Slackness. 6. Numerical Considerations. 6.1. Numerical Considerations. 6.2. The Revised Simplex Method. 6.3. Gaussian Elimination. 6.4. Numerical Accuracy. 6.5. The Ellipsoidal Algorithm. 6.6. The Karmarkar Algorithm --
II. Related Problems. 7. Matrix Games. 7.1. Matching Games. 7.2. Optimal Strategies. 7.3. Matrix Games and Linear Programs. 7.4. Linear Programs and Symmetric Games. 8. Assignment and Matching Problems. 8.1. The Assignment Problem. 8.2. Kuhn's Hungarian Algorithm. 8.3. Konig's Theorem. 8.4. Matching and Hall's Theorem. 8.5. Assignments and Linear Programs. 8.6. Egervary's Theorem. 8.7. Von Neumann's Hide-and-Seek Game. 8.8. Doubly Stochastic Matrices. 9. The Transportation Problem. 9.1. The Transportation Problem. 9.2. Phase One of Dantzig's Method. 9.3. The Dual of the Transportation Problem. 9.4. Dantzig's Method. 9.5. Economic Interpretation of the Dual Program. 9.6. Graphs and Trees. 9.7. Structure of Network Problems. 9.8. Pivoting in Graphs. 10. Network Flow Problems. 10.1. Network Flow Problems. 10.2. The Ford-Fulkerson Algorithm. 10.3. The Max-Flow, Min-Cut Theorem. 11. The Transshipment Problem. 11.1. The Transshipment Problem. 11.2. Shortest Path Problems. 11.3. A Transshipment Algorithm. 12. Nonlinear Programs. 12.1. Karush-Kuhn-Tucker Theorem. 12.2. The Constraint Qualification. 12.3. Least Squares. 12.4. Least Distance. 12.5. Hybrid Problems. 12.6. Empirical Principal Pivoting. 12.7. Quadratic Programs. 12.8. Semidefinite Quadratic Programs. 12.9. An Algorithm for Quadratic Programs. 12.10. Noncanonical Quadratic Programs.
일련 제목: Computer science and scientific computing.
책임: Evar D. Nering, Albert W. Tucker.
더 많은 정보:

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/20259282>
library:oclcnum"20259282"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:copyrightYear"1993"
schema:creator
schema:datePublished"1993"
schema:description"I. Linear Programs. 1. Sample Linear Programs. 1.1. A Production Problem. 1.2. A Diet Problem. 1.3. A Transportation Problem. 1.4. An Informal Algorithm. 1.5. Graphical Representation. 2. Tableau Algebra. 2.1. Tableaux and the Duality Equation. 2.2. Pivot Exchange, Row Equations. 2.3. Pivot Exchange, Column Equations. 2.4. Equivalent Tableaux. 2.5. Basic Solutions. 2.6. Inversion. 2.7. Block Pivots. 2.8. Expanded Tableaux. 3. Canonical Duality. 3.1. Canonical Dual Linear Programs. 3.2. Sufficient Conditions for Optimality. 3.3. Economic Interpretation of Duality. 3.4. Heuristic Pivoting. 3.5. Optimal Solutions -- Unique, Multiple, None. 3.6. The Geometric Picture. 3.7. Feasibility Algorithm. 3.8. Priority Pivoting. 4. The Simplex Algorithm. 4.1. The Simplex Algorithm. 4.2. Degeneracy and Cycling. 4.3. Bland's Anticycling Rule. 4.4. Theorems of the Two Alternatives. 4.5. The Dual Simplex Algorithm. 4.6. The Theorem of the Four Alternatives. 4.7. The Existence-Duality Theorem. 5. General Linear Programs. 5.1. General Dual Linear Programs. 5.2. Reduction to Canonical Form. 5.3. The Two-Phase Simplex Method. 5.4. Systems of Linear Inequalities. 5.5. Complementary Slackness. 6. Numerical Considerations. 6.1. Numerical Considerations. 6.2. The Revised Simplex Method. 6.3. Gaussian Elimination. 6.4. Numerical Accuracy. 6.5. The Ellipsoidal Algorithm. 6.6. The Karmarkar Algorithm -- II. Related Problems. 7. Matrix Games. 7.1. Matching Games. 7.2. Optimal Strategies. 7.3. Matrix Games and Linear Programs. 7.4. Linear Programs and Symmetric Games. 8. Assignment and Matching Problems. 8.1. The Assignment Problem. 8.2. Kuhn's Hungarian Algorithm. 8.3. Konig's Theorem. 8.4. Matching and Hall's Theorem. 8.5. Assignments and Linear Programs. 8.6. Egervary's Theorem. 8.7. Von Neumann's Hide-and-Seek Game. 8.8. Doubly Stochastic Matrices. 9. The Transportation Problem. 9.1. The Transportation Problem. 9.2. Phase One of Dantzig's Method. 9.3. The Dual of the Transportation Problem. 9.4. Dantzig's Method. 9.5. Economic Interpretation of the Dual Program. 9.6. Graphs and Trees. 9.7. Structure of Network Problems. 9.8. Pivoting in Graphs. 10. Network Flow Problems. 10.1. Network Flow Problems. 10.2. The Ford-Fulkerson Algorithm. 10.3. The Max-Flow, Min-Cut Theorem. 11. The Transshipment Problem. 11.1. The Transshipment Problem. 11.2. Shortest Path Problems. 11.3. A Transshipment Algorithm. 12. Nonlinear Programs. 12.1. Karush-Kuhn-Tucker Theorem. 12.2. The Constraint Qualification. 12.3. Least Squares. 12.4. Least Distance. 12.5. Hybrid Problems. 12.6. Empirical Principal Pivoting. 12.7. Quadratic Programs. 12.8. Semidefinite Quadratic Programs. 12.9. An Algorithm for Quadratic Programs. 12.10. Noncanonical Quadratic Programs."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/22036486>
schema:inLanguage"en"
schema:isPartOf
schema:name"Linear programs and related problems"@en
schema:publication
schema:publisher
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GB9341448>
wdrs:describedby

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.