Linear and nonlinear programming – MCQs – EE

1. Linear programming problems have:
(A) Nonlinear constraints only
(B) Linear objective function and linear constraints
(C) Step response only
(D) Quadratic objective function

2. The feasible region in linear programming is:
(A) Non-convex
(B) Convex polygon
(C) Step response only
(D) Hyperbola

3. The objective function in linear programming is:
(A) The function to be minimized or maximized
(B) Step response only
(C) Load current only
(D) Voltage magnitude

4. Constraints in linear programming can be:
(A) Inequalities or equalities
(B) Step response only
(C) Only reactive power
(D) Load flow only

5. The Simplex method is used for:
(A) Linear programming problems
(B) Step response only
(C) Nonlinear optimization only
(D) Load flow only

6. In nonlinear programming, the objective function is:
(A) Linear
(B) Nonlinear
(C) Step response only
(D) Load flow only

7. Lagrange multipliers are used to:
(A) Solve constrained optimization problems
(B) Step response only
(C) Only linear equations
(D) Load current measurement

8. Kuhn-Tucker conditions apply to:
(A) Nonlinear programming with inequality constraints
(B) Step response only
(C) Only linear programming
(D) Load flow only

9. Graphical method can be used for:
(A) Two-variable linear programming problems
(B) Step response only
(C) Nonlinear programming only
(D) Load flow only

10. Slack variables are introduced to:
(A) Convert inequalities into equalities
(B) Step response only
(C) Only measure current
(D) Load flow only

11. Surrogate constraint method is used in:
(A) Nonlinear programming
(B) Step response only
(C) Linear programming only
(D) Load flow only

12. Gradient-based methods are used in:
(A) Nonlinear optimization
(B) Step response only
(C) Only linear equations
(D) Load flow only

13. Convexity of the objective function ensures:
(A) Global optimum exists
(B) Step response only
(C) Local optimum only
(D) Load flow only

14. Penalty function methods help to:
(A) Handle constraints in nonlinear programming
(B) Step response only
(C) Only linear programming
(D) Measure RMS voltage

15. Dynamic programming solves problems by:
(A) Breaking into simpler subproblems
(B) Step response only
(C) Only plotting curves
(D) Load shedding only

16. Objective function in economic dispatch is:
(A) Minimize fuel cost
(B) Step response only
(C) Voltage magnitude only
(D) Load current only

17. Nonlinear constraints can be:
(A) Equations or inequalities
(B) Step response only
(C) Only linear
(D) Load flow only

18. Iterative methods are often used in:
(A) Nonlinear programming
(B) Step response only
(C) Only linear equations
(D) Load flow only

19. Sensitivity analysis in LP helps to:
(A) Determine how changes in coefficients affect optimal solution
(B) Step response only
(C) Voltage measurement only
(D) Load current only

20. Duality in linear programming provides:
(A) Relationship between primal and dual problems
(B) Step response only
(C) Only load flow
(D) RMS voltage only

21. Kuhn-Tucker multipliers are analogous to:
(A) Lagrange multipliers in nonlinear programming
(B) Step response only
(C) Load flow only
(D) RMS voltage

22. Simplex iterations terminate when:
(A) Optimal solution is reached
(B) Step response only
(C) Voltage drops
(D) Load current exceeds rating

23. Piecewise linearization can be applied to:
(A) Approximate nonlinear functions in linear programming
(B) Step response only
(C) Only nonlinear programming
(D) Load flow only

24. Feasible region in nonlinear programming can be:
(A) Non-convex or disconnected
(B) Step response only
(C) Only convex
(D) Load flow only

25. Sequential quadratic programming (SQP) solves:
(A) Nonlinear programming problems iteratively
(B) Step response only
(C) Only linear programming
(D) Load flow only

26. Lagrangian function is used to:
(A) Combine objective and constraints for optimization
(B) Step response only
(C) Only linear equations
(D) Load current measurement

27. Slack and surplus variables are used to:
(A) Transform inequalities into equalities
(B) Step response only
(C) Only measure voltage
(D) Load flow only

28. Gradient descent is:
(A) A local search method for nonlinear optimization
(B) Step response only
(C) Only for linear programming
(D) Load flow method

29. Convergence criteria in nonlinear programming include:
(A) Maximum iterations and tolerance for changes in objective
(B) Step response only
(C) Load flow only
(D) Voltage magnitude only

30. Multi-objective programming optimizes:
(A) More than one objective simultaneously
(B) Step response only
(C) Only single-objective
(D) Load flow only