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
1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!
1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}
3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓ
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