MARC 닫기
00447nam ac200169 k 4500
000003545381
20220101120000
ta
010731s1976 US 000 eng
▼a 211070
▼c 211070
▼l WM0004003416
▼l WM0004010654
▼c 2
▼a T57.74
▼a T57.74
▼b M87
▼a LINEAR AND COMBINATORIAL PROGRAMMING/
▼d MURTY,KATTA G
▼a NEW YORK:
▼b JOHN WILEY & SONS,
▼c 1976.
▼a 567p.
▼a MURTY,KATTA G
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | T57.74 |
| 서명/저자사항 : | LINEAR AND COMBINATORIAL PROGRAMMING/ MURTY,KATTA G |
| 발행사항 : | NEW YORK: JOHN WILEY & SONS, 1976. |
| 형태사항 : | 567p. |
| 개인저자 : | MURTY,KATTA G |
| 언어 | 영어 |
WMO199908196
권 호 : 567
발행년 : 1976
서 명 : LINEAR AND COMBINATORIAL PROGRAMMING
발행처 : MURTY,KATTA G
목차
1. FORMULATION OF LINEAR PROGRAMS
2. THE SIMPLEX METHOD
3. THE GEOMETRY OF THE SIMPLEX METHOD
4. DUALITY IN LINEAR PROGRAMMING
5. REVISED SIMPLEX METHOD
6. THE DUAL SIMPLEX METHOD
7. PARAMETRIC LINEAR PROGRAMS
8. SENSITIVITY ANALYSIS
9. DEGENERACY IN LINEAR PROGRAMMING
10. BOUNDED VARIABLE LINEAR PROGRAMS
11. PRIMAL ALGORITHM FOR THE TRANSPORTATION PROBLEM
12. NETWORK ALGORITHMS
13. FORMULATION OF INTEGER AND COMBINATIONAL PROGRAMMING PROBLEMS
14. CUTTING PLANE METHODS FOR INTEGER PROGRAMMING
15. THE BRANCH AND COUND APPROACH
16. COMPLEMENTARITY PROBLEMS...
서평쓰기