Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 2, Problem 22RP

Explanation of Solution

a.

Determining A:

Let aij denote the ijth element of matrix A.

Assume that rows for the matrix refer to the inputs and column for the matrix refer to the output.

Define steel as product 1, car as product 2, and machine as product 3.

Thus, a11 is the dollar value of steel required to produce $1 of steel, a21 is the dollar value of cars required to produce $1 of steel, and a31 is the dollar value of machines required to produce $1 of steel.

Therefore,

a11=0.30a21=0.15a31=0.40

Similarly, a12 is the dollar value of steel required to produce $1 of cars, a22 is the dollar value of cars required to produce $1 of cars, and a32 is the dollar value of machines required to produce $1 of cars.

Therefore,

a12=0

Explanation of Solution

b.

Proof:

It is given that s, c, and m represents the dollar value of steel, cars, and machines, produced in the economy respectively, and ds, dc, and dm represents the computation of steel, cars, and machines respectively.

Note that a product has two uses in the economy, one to produce other goods and the other one for the consumption. So, the total production of a product must be equal to the amount of that product used to produce other goods and the amount consumed, that is supply is equal to the demand.

For instance, for steel, its production must be equal to the dollar value of steel used in the steel’s production plus the dollar value of the steel used in the car’s production plus the dollar value of steel used in the machines production plus the dollar value of the steel’s consumption.

s=a11s+a12c+a13m+ds......(1)

Similarly,

c=a21s+a22c+a23m+dc

Explanation of Solution

c.

Proof:

Let,

X=[scm] and B=[dsdcdm]

Then, the equations (1), (2) and (3) can be written as,

X=AX+B......(4)

Since a matrix multiplied by the identity matrix is the matrix itself, so the equation (4) can be further written as,

IX=AX+B

Subtract from both sides of the equation

Explanation of Solution

d.

Consider the equation derived in part (c.)

(IA)[scm]=[dsdcdm]

Pre-multiply both sides by (IA)1.

(IA)1(IA)[scm]=(IA)1[dsdcdm]

Explanation of Solution

e.

It is given that the demand for steel goes up by $1.

Denote the new production levels by s',c',m'.

Then,

[s'c'm']=(IA)1[ds+1   dc   dm]......(6)

Thus, the change in production levels can be derived by subtracting equation (5) from the above equation (6).

[s'c'm'][scm]=(IA)1[ds+1   dc   dm](IA)1[ds

Blurred answer
Students have asked these similar questions
A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…
2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…
8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning