Scribd
Upload
198 views

Optimization Question

The document discusses key concepts in linear programming and design optimization problems. Linear programming is a constrained optimization technique for economic allocation of limited resources that uses linear variables and constraints. A design optimization problem can have equality constraints that are equal to, less than, or larger than the number of design variables. Constraints in an LP model restrict the use of available resources, and the degrees of freedom for an optimization problem is equal to the number of design variables.

Uploaded by

David Stuart
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
198 views

Optimization Question

The document discusses key concepts in linear programming and design optimization problems. Linear programming is a constrained optimization technique for economic allocation of limited resources that uses linear variables and constraints. A design optimization problem can have equality constraints that are equal to, less than, or larger than the number of design variables. Constraints in an LP model restrict the use of available resources, and the degrees of freedom for an optimization problem is equal to the number of design variables.

Uploaded by

David Stuart
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Each optimization problem must have certain parameters called

a. linear variables

b. dummy variables

c. design variables

d. none of the above

2. Linear Programming is a

Constrained optimization technique

Technique for economic allocation of limited resources   

Mathematical technique

All of the above

3. The number of equality constraints in the design optimization problem can be

a. larger than the number of design variables

b. less than the number of design variables

c. equal the number of design variables

d. b & c

4. All design variables should be independent of each other. (True)


5. A constraint in an LP model restricts

Value of objective function

Value of a decision variable

Use of the available resources

All of the above


6. The number of “≤ type” constraints must be less than the number of design variables for a
valid optimization problem formulation.(False)
7. The degrees of freedom for an optimization problem that has four design variables is

a. ¼

b. 4

c. ∜4

d. none of the above

8. The design optimization problem is infeasible when it meets all requirements. ( False)
9. The distinguish feature of LP model is
Relationship among all variables is linear   
It has single objective function & constraints  
Value of decision variables is non-negative 
All of the above

10. A “≤ type” constraint expressed in the standard form is inactive at a design point if it has
a. zero value
b. more than zero value
c less than zero value
d. none of the above

You might also like