-
-
카테고리 : 레포트 > 공학,기술계열 파일이름 :Network Models-연습문제.xlsx 문서분량 : 9 page 등록인 : repojaehoon 문서뷰어 : 
MS-엑셀뷰어프로그램등록/수정일 : 17.03.02 / 17.03.02 구매평가 : 
다운로드수 : 0 판매가격 : 1,300 원
미리보기
- 같은분야 연관자료
-
경영과학이론(계량적 경영론, 시스템이론)...2 pages 1000 원 [경영이론] 경영과학론, 시스템이론, 쿤츠의 밀림(정글)이론, 상황적합이론...3 pages 1600 원 [경영과학기법] 선형계획법, 대기행렬기법, 의사결정나무...3 pages 1600 원 경영과학이론(계량적 경영론, 시스템이론, 상황적응이론)...3 pages 1600 원 [시스템이론의 응용] 경영과학과 계량기법, 계량기법의 응용...3 pages 1600 원
- 보고서설명
- Operations Research Wayne L. Winston
Introduction to Mathematical Programming : Applications and Algorithms
엑셀풀이
Operations Research Wayne L. Winston
Network Models 연습문제 엑셀풀이
Introduction to Mathematical Programming : Applications and Algorithms
- 본문일부/목차
- 8.2-1 Find the shortest path from node 1 to node 6 in Figure 3.
8.2-6 It costs $40 to buy a telephone from the department
store. Assume that I can keep a telephone for at most five
years and that the estimated maintenance cost each year of
operation is as follows: year 1, $20; year 2, $30; year 3,
$40; year 4, $60; year 5, $70. I have just purchased a new
telephone. Assuming that a telephone has no salvage value,
determine how to minimize the total cost of purchasing and
operating a telephone for the next six years.
8.2-7 At the beginning of year 1, a new machine must be
purchased. The cost of maintaining a machine i years old is
given in Table 5.
The cost of purchasing a machine at the beginning of
each year is given in Table 6.
There is no trade-in value when a machine is replaced.
Your goal is to minimize the total cost (purchase plus
maintenance) of having a machine for five years. Determine
the years in which a new machine should be purchased.Seven types of packages are to be delivered by five
trucks. There are three packages of each type, and the
capacities of the five trucks are 6, 4, 5, 4, and 3 packages,
respectively. Set up a maximum-flow problem that can be
8.3-6 Seven types of packages are to be delivered by five
trucks. There are three packages of each type, and the
capacities of the five trucks are 6, 4, 5, 4, and 3 packages,
respectively. Set up a maximum-flow problem that can be
used to determine whether the packages can be loaded so
that no truck carries two packages of the same type.
8.3-7 Four workers are available to perform jobs 1–4.
Unfortunately, three workers can do only certain jobs:
worker 1, only job 1; worker 2, only jobs 1 and 2; worker
3, only job 2; worker 4, any job. Draw the network for the
maximum-flow problem that can be used to determine
whether all jobs can be assigned to a suitable worker.
8.5-4b Each year, Data Corporal produces as many as 400
computers in Boston and 300 computers in Raleigh. Los
Angeles customers must receive 400 computers, and 300
computers must be supplied to Austin customers. Producing
a computer costs $800 in Boston and $900 in Raleigh.
Computers are transported by plane and may be sent through
Chicago. The costs of sending a computer between pairs of
cities are shown in Table 34.
8.5-5a, b Oilco has oil fields in San Diego and Los Angeles. The
San Diego field can produce 500,000 barrels per day, and
the Los Angeles field can produce 400,000 barrels per day.
Oil is sent from the fields to a refinery, in either Dallas or
Houston (assume each refinery has unlimited capacity). To
refine 100,000 barrels costs $700 at Dallas and $900 at
Houston. Refined oil is shipped to customers in Chicago
and New York. Chicago customers require 400,000 barrels
per day, and New York customers require 300,000 barrels
per day. The costs of shipping 100,000 barrels of oil (refined
or unrefined) between cities are shown in Table 35.
- 연관검색어
- 경영과학
구매평가
| 구매평가 기록이 없습니다 |
- 보상규정 및 환불정책
-
· 해피레포트는 다운로드 받은 파일에 문제가 있을 경우(손상된 파일/설명과 다른자료/중복자료 등) 1주일이내 환불요청 시
환불(재충전) 해드립니다. (단, 단순 변심 및 실수로 인한 환불은 되지 않습니다.)
· 파일이 열리지 않거나 브라우저 오류로 인해 다운이 되지 않으면 고객센터로 문의바랍니다.
· 다운로드 받은 파일은 참고자료로 이용하셔야 하며,자료의 활용에 대한 모든 책임은 다운로드 받은 회원님에게 있습니다.
저작권안내
보고서 내용중의 의견 및 입장은 당사와 무관하며, 그 내용의 진위여부도 당사는 보증하지 않습니다.
보고서의 저작권 및 모든 법적 책임은 등록인에게 있으며, 무단전재 및 재배포를 금합니다.
저작권 문제 발생시 원저작권자의 입장에서 해결해드리고 있습니다. 저작권침해신고 바로가기
보고서의 저작권 및 모든 법적 책임은 등록인에게 있으며, 무단전재 및 재배포를 금합니다.
저작권 문제 발생시 원저작권자의 입장에서 해결해드리고 있습니다. 저작권침해신고 바로가기
