Question Bank (CHE-S508) PDF

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

DEPARTMENT OF CHEMICAL ENGINEERING

IVth YEAR B.TECH


OPTIMIZATION TECHNIQUE (CHE-S508)
QUESTION BANK, SESSION 2019-2020
Q1.Find the volume of largest rectangular solid inscribed in the ellipsoid.
(x2/a2) + (y2/b2) + (z2/c2) = 1
Q2.Find the volume of the largest right circular cylinder that can be inscribed inside a sphere of radius R.
Q3.A poster is to contain 300 cm2 of printed matter with margins of 6 cm at the top and bottom and 4 cm at
each side. Find the overall dimensions that minimize the total area of the poster.
Q4.A trucking company has borrowed $600,000 for new equipment and is contemplating three kinds of trucks.
Truck A costs $10,000, truck B $20,000, and truck C $23,000. How many trucks of each kind should be
ordered to obtain the greatest capacity in ton miles per day based on the following data?
Truck A requires one driver per day and produces 2100 ton-miles per day.
Truck B requires two drivers per day and produces 3600 ton-miles per day.
Truck C requires two drivers per day and produces 3780 ton-miles per day.
There is a limit of 30 trucks and 145 drivers.
Q5.Formulate a complete mathematical statement of the problem, and label each individual part, identifying the
objective function and constraints with the correct units ($, days, etc.). Make a list of the variables by names
and symbol plus units. Do not solve.
Q6.Find the minimum of f = λ5 − 5λ3 − 20λ + 5 using Dichotomous Search method, in the interval (1.0, 2.0) to
within 10% of the exact value.
Q7.Minimize ( ) over the interval 1 ≤ x ≤ 5, using Quasi Newton method.
Q8.Let ( ) . Let the initial interval be [0, 1]. Try to minimize φ(t) by Golden section method.
Q9.Maximize ƒ(x) = -x + 3x2 + 9x + 10 in the interval -2 ≤ x ≤ 4 to within 10% of exact value using interval
3

halving method.
Q10.Describe the Newton method to find optimality of a function of one variable. Hence find the point of
minimum of the function.
f (x) = x2 + 54/x
Q11.Find the minimum of the function f(x) = 2x3 – 5x2 -8in the interval (1.0, 3.0) by the Finonacci methods
using n=6.
Q12.Find the solution of function f(x, y) using method of constrained variation:
Minimize f(X) = ( )
subject to
g1(X) = x1 − x2 = 0
g2(X) = x1 + x2 + x3 − 1 = 0

Q13.What do you mean by constraint qualification? Consider the following problem:


Minimize f (x1, x2) = (x1 − 1)2 + x22
Subject to
g1 (x1, x2) = x13 − 2x2 ≤ 0
g2 (x1, x2) = x13 + 2x2 ≤ 0
Q14.Determine whether the constraint qualification and the Kuhn–Tucker conditions are satisfied at the
optimum point.
Q15.What is the significance of Lagrange Multipliers? Find the optimal solution of given objective function
using the Lagrange multiplier method:
Minimize f (x, y) = kx−1y−2
Subject to
g (x, y) = x2 + y2 − a2 = 0
Q16.Find the dimensions of a cylindrical tin using the Method of Lagrange Multipliers, (with top and bottom)
made up of sheet metal to maximize its volume such that the total surface area is equal to A 0= 24π.
Q17.State the Kuhn–Tucker conditions. Using Kuhn–Tucker conditions, find the value(s) of β for which the
point x1= 1, x2= 2 will be optimal to the problem:
Maximize f (x1, x2) = 2x1 + βx2
subject to
g1(x1, x2) =
g2(x1, x2) = x1− x2− 2 ≤ 0
Q18.A company has three factories X, Y and Z producing product P and two warehouses to stock the goods and
the goods are to be sent to four market centers A, B, C and D when the demand arises. The table given
below shows the cost of transportation from factories to warehouses and from warehouses to the market
centers, the capacities of the factories, and the demands of the market centers. Formulate a transportation
matrix and solve the problem for minimizing the total transportation cost.

A B C D Available

X 18 17 21 22 150

Y 18 17 21 22 100

Z 18 19 17 24 100

Required. 80 100 70 100 350

Q19.Four factories, A, B, C and D produce sugar and the capacity of each factory is given below: Factory A
produces 10 tons of sugar and B produces 8 tons of sugar, C produces 5 tons of sugar and that of D is 6 tons
of sugar. The sugar has demand in three markets X, Y and Z. The demand of market X is 7 tons, that of
market Y is 12 tons and the demand of market Z is 4 tons. The following matrix gives the transportation cost
of 1 ton of sugar from each factory to the destinations. Find the Optimal Solution for least cost
transportation cost.
Factories. Cost in Rs. per tons (x100) Availability in tons.
Markets.
X Y Z
A 4 3 2 10
B 5 6 1 8
C 6 4 3 5
D 3 5 4 6
7 12 5 ∑b = 29, ∑d = 24
Q20.Obtain the optimal solution of the following transportation problem.
3 5 6 4 1700
6 8 2 3 1900
5 7 4 11 1000
8 5 13 10 1400
1000 1200 1500 2300
Q21.The following fig. 1 shows the route map of various branch offices of a company. The marketing executive
of the company should like to start from Head office at A and reach the branch office at B by traveling
shortest path and visiting as many as branch offices. Help him to plan his journey by using dynamic
programming technique.

Q22.Define dynamic programming. J. R. Carrington has $4 million to invest in three oil well sites. The amount
of revenue earned from site i(i _ 1, 2, 3) depends on the amount of money invested in site i (see Table).
Assuming that the amount invested in a site must be an exact multiple of $1 million, use dynamic
programming to determine an investment policy that will maximize the revenue J. R. will earn from his
three oil wells.

Amount Invested Revenue ($ Millions)


($ Millions) Site Site Site
1 2 3
0 4 3 3
1 7 6 7
2 8 10 8
3 9 12 13
4 11 14 15

Q23.A company wants to determine how many units of each of two products, A and B, they should produce.
The profit on product A is $50 and the profit on product B is $45. Applying linear programming to this
problem, which of the following is the objective function if the firm wants to make as much money as
possible?
i) Minimize Z = 50 A + 45 B
ii) Maximize Z = 50 A + 45 B
iii) Maximize Z = A + B
iv) Minimize Z = A + B
v) Maximize Z = A/45B + B/50A
Q24.Apply linear programming to this problem. A firm wants to determine how many units of each of two
products (products D and E) they should produce to make the most money. The profit in the manufacture of
a unit of product D is $100 and the profit in the manufacture of a unit of product E is $87. The firm is
limited by its total available labor hours and total available machine hours. The total labor hours per week
are 4,000. Product D takes 5 hours per unit of labor and product E takes 7 hours per unit. The total machine
hours are 5,000 per week. Product D takes 9 hours per unit of machine time and product E takes 3 hours per
unit. Which of the following is one of the constraints for this linear program?
i) 5 D + 7 E =< 5,000
ii) 9 D + 3 E => 4,000
iii) 5 D + 7 E = 4,000
iv) 5 D + 9 E =< 5,000
v) 9 D + 3 E =< 5,000
Q25.An objective function in a linear program can be which of the following?
i) A maximization function
ii) A nonlinear maximization function
iii) A quadratic maximization function
iv) An uncertain quantity
v) A divisible additive function
Q26.The corner points of a feasible region based upon certain constraints are (0, 0), (300, 0), (180, 120), and (0,
240) for the objective function Z = 5x + 6y. What is the maximum value of the objective function?
i) 1680
ii) 1500
iii) 1620
iv) 1440
Q27.In the linear programming formulation of the transportation problem, cost of transporting one unit of the
material from a supply point to a demand point appears in
i) the objective function only.
ii) the constraints only.
iii) both objective function and constraints.
iv) neither objective function nor constraints.
Q28.In a transportation problem with total demand equal to 1200 and total supply equal to 900, we should add a
_______________ _____________ with a quantity equal to ___________ to convert it to a balanced
problem.
i) Dummy supply 300.
ii) Dummy supply 2100.
iii) Dummy demand 300.
iv) Dummy demand 2100.
Q29.Solve the following problem using simplex algorithm:
z = x1 - 2x2 + 3x3
Subject tox1 + x2 + x3 ≤ 7 x1 - x2 + x3 ≥ 2 3x1 - x2 - 2x3 = -5
x1, x2 ≥ 0
Q30.What do you mean by ‘Feasible solution and feasible region? Solve the following problem by simplex
method:
Maximize z = 2x + 5y
Subjected to: x + 4y ≤ 24
3x + y ≤ 21
x+y≤9 x, y ≥ 0
Q31.A patient consults a doctor to check up his ill health. Doctor examines him and advises him that he is
having deficiency of two vitamins, vitamin A and vitamin D. Doctor advises him to consume vitamin A and
D regularly for a period of time so that he can regain his health. Doctor prescribes tonic X and tonic Y,
which are having vitamin A, and D in certain proportion. Also advises the patient to consume at least 40
units of vitamin A and 50 units of vitamin Daily. The cost of tonics X and Y and the proportion of vitamin A
and D that present in X and Y are given in the table below. Formulate L.P.P. to minimize the cost of tonics.
Vitamins Tonics Daily requirements in units
X Y
A 2 4 40
B 3 2 50
Cost in Rs. per unit 5 3

Q32.Consider Rosenbrock’s function:


( ) ( ) ( )
and the starting point x0 = [-1.2, 0]
Find x* such that ƒ(x*) is a minimum, Using Powell’s conjugate directions method.
Q33.Minimize f (x1, x2) = x1 − x2 + 2x12 + 2x1x2 + x22 with the starting point (0, 0).
a) Using Univariate method.
b) Using Steepest Descent (Cauchy) method
Q34.Consider the problem:
Minimize f = 6x12 − 6x1x2 + 2x22 − x1 − 2x2
Find the minimum of this function in the range −5 ≤ xi ≤ 5, i = 1, 2, using the random walk method with
direction exploitation.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy