Anda di halaman 1dari 3

# MAHATMA GANDHI UNIVERISTY, KOTTAYAM-686560

## B.TECH CHEMICAL ENGINEERING

MODEL QUESTION PAPER
CH010 803 CHEMICAL PROCESS OPTIMISATION

## PART A (3x5 = 15 marks)

1. State five engineering applications of optimization.
2. What is a one dimensional minimization problem?
3. What is a dichotomous search method?
4. What is a basic degenerate solution?
5. What is a parametric constraint?

## PART B (5x5=25 marks)

6. Distinguish between a) optimization and maximisation b) Internal restrictions and external
restrictions.
7. What do you mean by a) Global optimum and local optimum b) monotonic functions and
discrete functions?
8. What are the necessary and sufficient conditions for the optimization of a single variable
objective function?
9. In what way the Fletcher-Reever method is different from and is superior to ordinary
steepest ascent or descent methods?
10. What is dynamic programming? Discuss with examples.

## PART C (12x5 = 60 marks)

(Answer one full question from each module)

MODULE-I

11. In a two stage compressor, the working gas leaving the first stage of compression is cooled
(by passing it through a heat exchanger) before it enters the second stage of compression to
increase the efficiency. The total work input to a compressor (W) for an ideal gas, for
isentropic compression is given by

Where Cp is the specific heat of the gas at constant pressure, k is the ratio of specific heat at
constant pressure to that at constant volume of the gas, and T1 is the temperature at which the
gas enters the compressor. Find the pressure p2, at which inter cooling should be done to

119
minimize the work input to the compressor. Also determine the minimum work done on the
compressor.

OR

12. A cargo load is to be prepared from five types of article. The weight wi, volume vi , and
monetary value ci of different article are given below.

Article Type wi vi ci
1 4 9 5
2 8 7 6
3 2 4 3
4 5 3 2
5 3 8 8
th
Find the number of article xi selected from the i type (1, 2, 3, 4, 5), so that the total monetary
value of the cargo load is maximum. The total weight and volume of the cargo cannot exceed
the limit of 2000 and 2500 units, respectively.

MODULE-II

13. Describe the Newton and Quasi-Newton method for unconstrained single variable
optimization.

OR

## 14. Find the minimum of the function

Using the Newton- Raphson method with the starting point 1 = 0.1. use = 0.01 for
checking the convergence

MODULE-III

15. Use the Fibonacci method to find the maximum of the function

y= 9x - 0.1x2 in the range 0 x 100 with an accuracy of 0.1 percent of the original range.

OR

16. Minimize using Powells method the function x1 x2 +2x12 +2x1x2 +x22 from the starting
point (0, 0)

120
MODULE-IV

17. A paper mill received an order for the supply of paper rolls of width and lengths as
indicated below.

## Number of rolls Width of Roll Length

ordered (m) (m)
1 6 100
1 8 300
1 9 200

The mill produces rolls only in two standard widths, 10 and 20 m. the mill cuts the
standard rolls to size to meet the specifications of the orders. Assuming that there is no
limit on the lengths of the standard rolls, find the cutting patter that minimizes the trim
losses while satisfying the order above.

OR

18. The production of two machine parts A and B requires operation on lathe (L), a shaper (S),
a drilling machine (D), a milling machine(M), and a grinding machine (G). the machining
times required by A and B on various machines are given below.

## Machine Machine Time required ( hours per unit) on:

Part L S D M G
A 0.6 0.4 0.1 0.5 0.2
B 0.9 0.1 0.2 0.3 0.3

The number of types of different types available is given by L: 10, S:3, D:4, M:6, and
G:5. Each machine can be used for 8 hours a day for 30 days in a month. Determine the
production plan for maximizing the output in a month.

MODULE-V

19. Discuss on Zoutendijk method. When can you use the steepest descent direction as a usable
feasible direction in Zoutendijks method?

OR

20. Describe the Rosens gradient projection method. Write down the step by step procedure for
solving the optimization problem.

121