Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Expert Solution & Answer
Book Icon
Chapter 3.9, Problem 1P

Explanation of Solution

Given:

Let xi be the number of hours process which takes for “i” run per week where i=1,2,3. Let Oi be the number of barrels of oil and G2 be the barrels of gas 2 sold per week.

Objective function:

The processor 1 that runs for 1 hour requires 2 barrels of crude oil 1 and 3 barrels of crude oil 2 and the output of process 1 for one hour produces 2 barrels of gas 1 and 1 barrel of gas 2.

The processor 2 that runs for 1 hour requires 2 barrels of crude oil 1 and 3 barrels of crude oil 2 and the output of process 2 for one hour produces 3 barrels of gas 2.

The process 3 that runs for 1 hour requires 2 barrels of crude 2 and 2 barrels of gas 2 and the output of process 3 for one hour produces 2 barrels of gas 3.

The revenue from the gas 1 is sold for $9 and the revenue from gas 3 is sold for $24 is 24(2x3). Here, the variable for gas 2 is sold and the remaining gas will be used in producing gas 3.

Maximizez=9(2x1)+10G2+24(2x3)5x14x2x32O13O2=13x14x2+47x3+10G22O13O2

Considering the constraints,

Constraint 1: Total oil 1 used in process 1 and 2.

Constraint 2: Total oil 2 used in process 1,2 and 3.

Constraint 3 and 4: Each week, 200 barrels of crude oil 1 and 300 barrels of crude oil 2 must be purchased.

Constraint 4: Production gas 2 will be equal to the gas 2 sold and gas 2 used in 3 that have been produced by process 1 and 2 by using the amount of gas 2 produced and from each process.

Constraint 6: Each week, 100 hours of time catalytic crackers are available.

Expressing the constraint 1 in terms of x1, x2and x3 :

(2barrel of oil 1 used for process 1)+(1 barrel of oil 2 used for process 2)=O12x1+x2=O12x1+x2O1=0

Expressing the constraint 2 in terms of x1,

Blurred answer
Students have asked these similar questions
Question 34 Frontline Agricultural Processing Systems uses several ingredients to make wheat crackers. After several years of operations and testing, their scientists found high protein and carbohydrates in two of their ingredients, barley and corn. While an ounce of barley costs $0.25, an ounce of corn costs $0.46. While an ounce of barley provides 9 mg of protein and 1 mg of carbohydrates, an ounce of corn provides 7 mg of protein and 5 mg of carbohydrates. Recently, demand for wheat crackers has increased. To lower the overall cost of producing wheat crackers, Frontline Agricultural Processing Systems will want to know how many ounces of barley and corn to include in each box of wheat crackers to meet the minimum requirements of 160 milligrams of protein and 40 milligrams of carbohydrates. If the carbohydrate requirement is reduced by 2 milligrams, how much reduction would the optimal cost change by? Round to 2 decimal places.
A factory produces two types of wood blocks with 2m and 4m lengths. The blocks are moved by a conveyor belt and passing under two photocells A and B spaced by 3m apart as shown in the following figure. The blocks are separated by more than 4m. A trap door is placed immediately to the right of photocell B. To separate the two types of blocks, it is required that the trap door should open when the small block pass under Band close when the blocks passed beyond B. The door opens when the output (2) of state machine is logic 1. The designer needs for . AND-gate(s) for implementing the aforementioned state machine (2) a d> 4m 3m 0.25m
A factory produces two types of 2 points wood blocks with 2m and 4m lengths. The blocks are moved by a conveyor belt and passing under two photocells A and B spaced by 3m apart as shown in the following figure. The blocks are separated by more than 4m. A trap door is placed immediately to the right of photocell B. To separate the two types of blocks, it is required that the trap door should open when the small block pass under B and close when the blocks passed beyond B. The door opens when the output (Z) of state machine is logic 1. How many states the designer needs for drawing the minimal Mealy state diagram? * d> 4m 3m 0.25m 6. 5 4.

Chapter 3 Solutions

Operations Research : Applications and Algorithms

Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
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++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning