Operations Research Wayne L. Winston Introduction to Mathematical Prog…
페이지 정보
작성일 23-04-22 17:41
본문
Download : Network Models-연습문제.xlsx
8.5-4b Each year, Data Corporal produces as many as 400
computers in Boston and 300 computers in Raleigh. Los
whether all jobs can be assigned to a suitable worker.
capacities of the five trucks are 6, 4, 5, 4, and 3 packages,
or unrefined) between cities are shown in Table 35.
and New York. Chicago customers require 400,000 barrels
years and that the estimated maintenance cost each year of
operating a telephone for the next six years.
Computers are transported by plane and may be sent through
$40; year 4, $60; year 5, $70. I have just purchased a new
respectively. Set up a maximum-flow problem that can be
per day. The costs of shipping 100,000 barrels of oil (refined
Chicago. The costs of sending a computer between pairs of
capacities of the five trucks are 6, 4, 5, 4, and 3 packages,
Unfortunately, three workers can do only certain jobs:
store. Assume that I can keep a telephone for at most five
San Diego field can produce 500,000 barrels per day, and
엑셀풀이
used to determine whether the packages can be loaded so
maximum-flow problem that can be used to determine
a computer costs $800 in Boston and $900 in Raleigh.
There is no trade-in value when a machine is replaced.
8.3-6 Seven types of packages are to be delivered by five
Angeles customers must receive 400 computers, and 300
worker 1, only job 1; worker 2, only jobs 1 and 2; worker
Operations Research Wayne L. Winston Introduction to Mathematical Programming : Applications and Alg
설명
trucks. There are three packages of each type, and the
8.2-6 It costs $40 to buy a telephone from the department
cities are shown in Table 34.
computers must be supplied to Austin customers. Producing
3, only job 2; worker 4, any job. Draw the network for the
Introduction to Mathematical Programming : Applications and Algorithms
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
maintenance) of having a machine for five years. Determine
8.5-5a, b Oilco has oil fields in San Diego and Los Angeles. The
respectively. Set up a maximum-flow problem that can be
operation is as follows: year 1, $20; year 2, $30; year 3,
Network Models 연습문제 엑셀풀이
The cost of purchasing a machine at the beginning of
순서
determine how to minimize the total cost of purchasing and
the years in which a new machine should be purchased.Seven types of packages are to be delivered by five
that no truck carries two packages of the same type.
8.3-7 Four workers are available to perform jobs 1–4.
given in Table 5.
Introduction to Mathematical Programming : Applications and Algorithms
Operations Research Wayne L. Winston
레포트 > 공학,기술계열
8.2-1 Find the shortest path from node 1 to node 6 in Figure 3.
telephone. Assuming that a telephone has no salvage value,
each year is given in Table 6.
purchased. The cost of maintaining a machine i years old is
Houston. Refined oil is shipped to customers in Chicago
per day, and New York customers require 300,000 barrels
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-7 At the beginning of year 1, a new machine must be
Operations Research Wayne L. Winston
Download : Network Models-연습문제.xlsx( 43 )
trucks. There are three packages of each type, and the
경영과학
refine 100,000 barrels costs $700 at Dallas and $900 at
Your goal is to minimize the total cost (purchase plus
다.
