7/21/2019 Optimization Question Bank
1/1
Unit-1
Part-A
1. How do you solve a maximization problem as a minimization
problem?2. State the linear programming problem in standard
form.
3. Define an ! problem and give an engineering example.
". #hat is the differen$e between linear and nonlinear
programming problems?%. #hat is the differen$e between design
variables and preassigned parameters?
&. #hat is the differen$e between a $onstraint surfa$e and a
$omposite $onstraint surfa$e?
'. Suggest a simple method of handling multiple ob(e$tives in an
optimization problem.). State five engineering appli$ations of
optimization.
*. #hat is graphi$al optimization+ and what are its
limitations?1,. State the prin$iple behind the method of
$onstrained variation.
11. State the -uhn/u$0er $onditions.
12. #hat is an a$tive $onstraint?13. #hat is a $onvex
programming problem? #hat is its signifi$an$e?
1". How do you test the positive+ negative+ or indefiniteness of
a suare matrix A?
1%. Define a sto$hasti$ programming problem and give two
pra$ti$al examples.
1&. 4nder what $onditions $an a polynomial inn variables be
$alled a posynomial?
1'. #hat is a separable programming problem?
1). #hat are ob(e$tive fun$tion $ontours?1*. #hat is a merit
fun$tion?
2,. #hat is a design spa$e?
Part-B
