2-Marks Ques on and Answer Format – Op miza on Techniques
1. a. State the need of op miza on.
Ans: Op miza on is needed to find the best solu on among all feasible solu ons for efficient use of
resources like cost, me, or effort.
b. Illustrate the constraint surface with a relevant diagram.
Ans: A constraint surface represents the boundary formed by constraint equa ons in an op miza on
problem. For example, forms a straight line on the XY-plane.
c. When is the transporta on problem considered as degenerate?
Ans: A transporta on problem is degenerate when the number of alloca ons is less than (m+n−1),
where m is the number of rows and n is the number of columns.
d. Define (i) Surplus variable, and (ii) Ar ficial variable
Ans: (i) Surplus Variable: A variable subtracted to convert a '≥' constraint to an equa on.
(ii) Ar ficial Variable: An extra variable introduced to find the ini al feasible solu on.
e. What is dynamic programming technique?
Ans: Dynamic Programming is a method of solving complex problems by breaking them into simpler
sub-problems and solving each sub-problem only once.
f. Define total float.
Ans: Total float is the amount of me that a task can be delayed without delaying the project
comple on me.
g. Write the Kuhn-Tucker condi ons for the case of maximiza on.
Ans: Kuhn-Tucker Condi ons (for maximiza on): Lagrangian: with constraints , Sta onarity, primal
feasibility, dual feasibility, and complementary slackness.
2. a. Discuss about design vector.
Ans: Design vector is a set of design variables that represent the system in mathema cal
op miza on.
b. State the difference between CPM and PERT.
Ans: CPM is determinis c; PERT is probabilis c. CPM uses one me es mate; PERT uses three.
c. How can a mul variable op miza on problem with equality constraints be solved?
Ans: Mul variable op miza on with equality constraints is solved using Lagrange mul pliers
method.
d. What is nonlinear programming?
Ans: Non-linear programming involves op mizing a nonlinear objec ve func on with nonlinear
constraints.
e. What do you mean by dynamic programming?
Ans: See 1(e).
f. Write Kuhn-Tucker condi ons.
Ans: See 1(g).
3. a. Write the statement of an op miza on problem.
Ans: An op miza on problem aims to maximize or minimize an objec ve func on subject to
constraints.
b. Describe the steps of the simplex method.
Ans: (1) Formulate the LP problem, (2) Convert to standard form, (3) Iden fy the basic feasible
solu on, (4) Perform itera ons using pivo ng, (5) Reach op mal solu on.
c. What is basic degenerate feasible solu on to the transporta on model?
Ans: A basic degenerate feasible solu on has at least one basic variable with a value of zero in the
transporta on model.
d. Explain the types of non-linear programming problems.
Ans: Types include: Constrained vs. unconstrained, Convex vs. non-convex, Single vs. mul variable
problems.
e. What are the three me es mates in PERT?
Ans: Op mis c me (O), Most likely me (M), and Pessimis c me (P).
f. Write the Kuhn-Tucker condi ons.
Ans: See 1(g).
4. a. Differen ate Global Maximum and Global Minimum value of a func on f(x).
Ans: Global Maximum: Largest value of func on over en re domain.
Global Minimum: Smallest value over en re domain.
b. How to resolve degeneracy in transporta on problem?
Ans: Degeneracy in transporta on is resolved by adding a very small value (ϵ) to unoccupied cells.
c. What is meant by infeasible solu on in Linear Programming problem?
Ans: An infeasible solu on does not sa sfy all constraints of the Linear Programming problem.
d. Explain the recursive method in dynamic programming.
Ans: Recursive method solves problems by solving sub-problems from last stage to the first.
e. Explain the need for search methods in op miza on.
Ans: Search methods are used to locate op mal points efficiently, especially in nonlinear and
unconstrained problems.
f. Differen ate cri cal ac vity and non-cri cal ac vity.
Ans: Cri cal ac vity: No float, delays affect project.
Non-cri cal: Has float, delays may not affect project.
g. State the necessary condi ons for extreme points in Lagrange mul plier method.
Ans: Necessary condi on: Gradient of Lagrangian must vanish, i.e., .
5. a. What are the limita ons of classical op miza on techniques?
Ans: Limita ons include: Require differen able func ons, may converge to local op ma, not suitable
for large/complex systems.
b. Differen ate feasible solu on and op mal solu on.
Ans: Feasible solu on sa sfies all constraints.
Op mal solu on is the best feasible solu on with minimum/maximum objec ve value.
c. What is meant by unbalanced transporta on problem?
Ans: An unbalanced transporta on problem has unequal supply and demand. It is balanced by
adding dummy row/column.
d. Explain the Bellman’s principle of op mality in dynamic programming.
Ans: Bellman’s principle: An op mal policy has the property that, regardless of ini al state, the
remaining decisions form an op mal policy.
e. When is a dummy ac vity required in a project network?
Ans: Dummy ac vity is used to preserve logic or dependency when no real ac vity exists between
two events.
f. What is meant by Resource alloca on for a project?
Ans: Resource alloca on is the assignment of limited resources to project tasks for op mal
performance.
6. (Repeated Set – See 1)
7. a. Illustrate the constraint surface.
Ans: Same as 1(b).
b. What do you mean by design variables in op miza on?
Ans: Design variables are quan es that can be controlled during op miza on, e.g., dimensions,
material proper es.
c. Define mul stage decision process.
Ans: A process where decisions are made in stages based on current state and decisions affect future
states.
d. Recall the mul variable op miza on problem statement with inequality constraint.
Ans: Find x that minimizes f(x) subject to .
e. Define non-linear programming with example.
Ans: See 2(d). Example: Minimize subject to .
f. List any two one-dimensional search methods used in op miza on.
Ans: Golden sec on search, Fibonacci method.
End of Document
