INSTRUCTIONS:

1. Answer the questio ns being sta ted under each topic. If yo u wa nt to add more information, feel free to a dd. M ake sure a dditional info rmation is significa nt to our study.
P lease add more questions or info rmation in the classifica tions.
2. Your output must be in paragraph format. For the flow, please follow the numbering. The purple boxes are our path choices.
3. In a dding references, the number o f the reference sho uld co rrespond to the number of the question.
It's o kay to hav e mo re than one reference for each question. Make sure the number before the reference co rresponds to the number o f the question.
For example:

1. Optimiza tion

1. Wha t is optimiza tion?

2. Where cn optimization be a pplied?

REFEREN CES:
1. Talbi, E.G. M etaheuristics: From design to Im plem enta tion, pp. 4-5
1. Ra o, S. Engineering Optimiza tion: T heory a nd Pra ctice, pp.4-5
2.Ra o, S. Engineering Optimiza tio n: Theo ry a nd Pra ctice, pp. 4-5
4. The subtopics under Problem Statement, Problem Complexity and Optimization Techniques are from left to right (for easier navigation)
5. Please use third person POV when writing.

1. Op timiz ation

1. What is o ptimizatio n?
2. Where can optimization be a pplied?

REFERENCES:
1.
2.

2. S tru ctural Optimization

1. What is Structural Optimiza tio n?

2. Why do we o ptimize? (Importance of optimiza tion e.g.
eco no mical, environmenta l)
3. What a re the different wa ys of optimizing structures? (Give beam
or truss exa mple here)
4. Why a re we pro po sing a new wa y o r algorithm for finding the
optimum? (e.g. some take more time)
5. What a re the elements o f a n optimiza tio n problem?

REFERENCES:
1.

3. P roblem Statem ent

1. What k ind of pro blem a re we ta ckling? (Minimization or Max imiza tion. Insert pro blem
statement here)
2. What a re trusses?
3. What ca n be optimized in truss structures? (Size, shape, topo logy)
3. What do we mean by size o ptimization o f truss structures?
4. Why do we o ptimize the size of truss structures?
5. What a re the co mpo nents o f a n optimiza tio n problem?

REFERENCES:
1.

3.1 O bjective Function

1. What is a n objective functio n? (Give technical definition & explain through the
given
2. What is the use of an objective function?
3. H ow can a n optimiza tio n problem be classified according to its o bjective function?
(Always cite reference from where classifica tio n is obta ined)

REFERENCES:
1.

3.1.1 Number of Objective Functions 3.1.2 Nature of Equations

3.1.2.4 Nonlinear Programm ing Problem

3 .1.1.1 S ingle-Objec tive P rogramm ing Problem 3.1.1.2 Multi-ob jective Program ming Prob lem 3.1.2.1 Linear Program ming P roblem
1. What is a No nlinea r Programming Pro blem?
1. Wha t is a single-objective functio n? 1. What is a multi-o bjectiv e function? 1. What is a Linea r Programming P ro blem? 2. When can a n o bjective function be co nsidered
2. Why is our pro blem considered a single-o bjective 2. Why is o ur problem no t considered a multi-objective 2. When ca n a n objective functio n be No nlinea r?
programming problem? pro gra mming pro blem? considered Linear? 3. Why is o ur o bjectiv e function considered
No nlinea r?
REFERENCES : REFERENCES: REFERENCES:
1. 1. 1. REFERENCES:
1.

3.2 Dom ain

1. What is a doma in? (Give technical definitio n & explain through the given exa mple)
2. What is the use of a doma in?
3. H ow can a n optimiza tio n problem be classified according to its doma in? (Alway s
cite reference fro m where cla ssification is o bta ined

REFERENCES:
1.

3.2.1 Number of Design Variables 3.2.2 Nature of the Design Variables 3.2.3 Permissible values of the Design Variables

3.2.2.1 Static Optim ization Prob lem 3.2.2.2 Dyn am ic Optim ization Prob lem 3.2.3 .1 Integer Program ming Problem 3.2.3.1 Real-valued P rogramm ing Problem
3.2.1.2 Multi-dim ensional
3 .2.1.1 O ne-Dim ens ional
1. What is static o ptimizatio n? 1. What is dynamic o ptimization? 1. What is Integer P ro gra mming? 1. What is Real-v alues Programming?
1. What is a multi-dimensio na l domain?
2. When ca n the v aria bles (para meters) be 2. When can the va riables (para meters) be 2. When can the v ariables be classified under 2. When ca n the varia bles be classified under Rea l-
1. Wha t is a one-dimensional doma in? 2. When ca n a domain be considered multi-dimensiona l?
considered sta tic? considered dynamic? Integer Programming? va lues Programming?
2. When can a dom ain be considered one-dimensional? 3. Why is the doma in in our problem considered multi-
3. Why ca n the pa rameters in our pro blem be 3. Why a re the para meters in our study not 3. Why a re the v ariables in o ur study considered 3. Why are the varia bles in o ur study no t considered to
dimensio na l?
considered sta tic? considered dynamic? to be classified Integer Pro gra mming? be cla ssified under Real-v alued Programming?
REFERENCES :
1. REFERENCES:
REFERENCES: REFERENCES: REFERENCES: REFERENCES:
1.
1. 1. 1. 1.

3.3 C onstraints

1. What a re co nstraints? (Give technica l definition & explain thro ugh the giv en
2. What is the use of a co nstraint?
3. H ow can a n optimiza tio n problem be classified according to its co nstraints? (Alwa ys
cite reference fro m where cla ssification is o bta ined

REFERENCES:
1.

3.3.1 Existence of Constraints 3.3.2 Nature of Equations 3.3.3 Deterministic Nature of the Variables

3.3.3.2 Determinis tic P rogramm ing

Problem
3.3.3 .1 Stoc hastic P rogramm ing Problem
3 .3.1.1 Unc onstrained Optimization P roblem 3.3.2.4 Nonlinear Programm ing Problem
3.3.1.2 Cons trained O ptimization Problem 3.3.2.1 Linear Program ming P roblem
1. What is a Deterministic Progra mming
1. What is a Sto cha stic Pro gra mming Problem?
1. Wha t is an unco nstrained optimization pro blem? 1. What is a No nlinea r Programming Pro blem? Problem?
1. What is a constrained optimiza tion pro blem? 1. What is a Linea r Programming P ro blem? 2. When can the co nstraints in the problem be
2. When can a problem be considered unconstra ined? 2. When can a constra int be considered 2. When ca n the constra ints in the pro blem be
2. When ca n a pro blem be co nsidered constra ined? 2. When ca n a constraint be considered considered sto chastic?
3. Why is the pro blem in our study not co nsidered No nlinea r? co nsidered deterministic?
3. Why is the problem in o ur study considered co nstrained? Linear? 3. Why a re the co nstraints in o ur study no t
unconstra ined? 3. Why a re our co nstraints considered N onlinear? 3. Why are the constraints in our pro blem
considered sto chastic?
co nsidered deterministic?
REFERENCES: REFERENCES:
REFERENCES : REFERENCES:
1. 1. REFERENCES:
1. 1. REFERENCES:
1.
1.

4. P roblem Complexity

1. What is P ro blem Complexity ?

2. What is the Complexity T heory?
3. What is the use of knowing the Pro blem Complexity?
4. H ow can a pro blem be cla ssified a cco rding to its Complexity?

REFERENCES:
1.

4.1 P-Hard Problems

4.2 NP-Hard Problems
1. What a re P-Ha rd P ro blems?
1. What a re N P-H ard Problems?
2. When ca n a pro blem be co nsidered P-Ha rd? (Cha racteristics)
2. When ca n a pro blem be co nsidered NP -H ard? (Chara cteristics)
3. Why is the problem in o ur study no t considered P -H ard?
3. Why is the problem in o ur study considered N P-Hard?
4. What type of Optimization Technique should be used fo r P-H ard
4. What type of Optimization Technique should be used fo r NP-Ha rd Pro blems?
Problems?
REFERENCES:
REFERENCES:
1.
1.

5. Op timiz ation Techniques

1. What a re Optimiza tio n Techniques?

2. Why a re there different Optimiza tio n Techniques? (NFL T heory)
3. H ow do y ou know what Optimization Technique to use?
4. H ow a re the Optimizatio n Techniques tested? (Test Functio ns, Benchma rk
pro blems)
5. H ow a re the Optimizatio n Techniques classified?

REFERENCES:
1.

5.1 Basis of Optimization Model

5.1.2 Non clas sic al Op timiz ation Method s

5.1.1 Classic al Optimization Methods
1. What a re N on classical Optim iza tion
1. What a re Classical Optimiza tion Methods? (Explain basis of mo del) Methods? (Ex pla in basis o f mo del)
2. When can these metho ds be used? 2. When ca n these methods be used?
3. What a re the cla ssifications of these metho ds a nd wha t are some 3. Why a re they called intermediate methods?
exa mples of ea ch classifica tio n? 4. What a re some ex amples o f these
methods?
REFERENC ES:
1. REFERENCES:
1.

5.1.2.1 Intermediate m ethods

1. Why a re they called intermediate methods?

Strong Methods Weak Methods
REFERENCES:
1.

Gradient-based Optimization Random Search

Swarm Intelligence-Ba sed Algo rithms

Simula ted Annea ling Tabu Search Ev olutio na ry Algorithms
Response Surface Methods Sampling Methods 1. What are Swarm I ntelligence-Ba sed
1. What is Simulated Annealing? 1. What is Ta bu Sea rch? 1. What a re Evolutionary Algorithms?
Algorithms?
2. When was it develo ped? 2. When was it dev eloped? 2. When was it dev eloped?
2. When wa s it develo ped?
Simplex Methods REFERENCES: REFERENCES: REFERENCES:
REFERENCES:
1. 1. 1.
1.

5.2 Based on Accuracy of Solution

5 .2.2 App roxim ate m ethods

5.2.1 Exac t Methods
1. Wha t are Approximate Methods?
1. What a re Exact M etho ds? 2. Why can Approxima te Metho ds be used for the
2. What a re some exa mples of Exact M ethods? problem in o ur study?
3. Why ca n't Exact M ethods be used for the problem in o ur study ? 3. Wha t are the classifica tions of Approximates
m etho ds?
REFERENC ES:
1. REFERENCES :
1.

A*, IDA* Dynamic Programming

A. Heuristic Algorithm s
Branch and x Constraint Programming B. App roxim ation algorithms
1. What a re Heusristic algorithms?
2. Why ca n they be applied in our study? 1. What a re Approxima tion algorithms?
Branch and bound
3. What a re the ca tego ries under Heuristic 2. Why ca n't they be used in o ur study?
algorithms?
Branch and cut REFERENCES:
REFERENCES: 1.
Branch and price 1.
 A.1 M etaheuristics
A.2 Problem -specific heuristics
1. Wha t are Meta heuristics?
2. Why can meta heuristic algoirthms be used in
1. What a re Problem-specific heuristics?
o ur study ?
2. Why ca n't this be applied to o ur study?
3. Wha t are the classifica tio ns o f metaheuristic
a lgo rithms?
REFERENCES:
1.
REFERENCES:
1.

A.1.1 Number of solutions A.1.2 Memory

A.1 .1.1 Population-bas ed search A.1.1.2 S ingle solution-based search A.1.2.2 Memoryless
A.1.2.1 M em ory usage
1. What a re Po pulation-ba sed search 1. What a re Single so lution-based search 1. What are memory less algorithms?
1. Ho w do a lgo rithms utilize memo ry?
algorithms? algorithms? 1. What are the advantages a nd disdva ntages
2. What is the a dv anta ge o f utilizing memo ry?
2. Why ca n this be a pplied to our study ? 2. Why ca n't this be applied to o ur study? o f using memoryless a lgo rithms?
REFERENCES:
REFERENCES: REFERENCES: REFERENCES:
1.
1. 1. 1.

A.1.3 Way of solving A.1.4 Deterministic Nature of Decision-making

A.1 .3.1 Iterative A.1.3.2 Greedy A.1.4.1 S tochastic A.1.4.2 Determin istic

1. What a re itera tive algorithms? 1. What a re greedy a lgo rithms? 1. What a re Stocha stic algorithms? 1. What are Deterministic algorithms?
2. What a re the a dv anta ges and 2. What a re the a dva nta ges and disadva ntages 2. What a re the a dv anta ges and disadva ntages 2. What are the advantages a nd disa dv anta ges
disa dv anta ges of using iterativ e a lgo rithms? of using greedy algorithms? of using Sto chastic a lgo rithms? o f using Deterministic a lgo rithms?
3. Why is this applica ble in our study? 3. Why is this no t applica ble in our study? 3. Why is this applica ble in our study? 3. Why is this not a pplicable in our study?

REFERENCES: REFERENCES: REFERENCES: REFERENCES:

1. 1. 1. 1.

A.1.5 Inspiration

A.1 .5.1 Nature-inspired algorithms A.1.5.1 Non-n ature ins pired algorithm s

1. What a re nature-inspired a lgo rithms? 1. What a re nature-inspired a lgo rithms?

REFERENCES: REFERENCES:
1. 1.

Swarm Intelligence-Bas ed Algorithms

Evolutionary Algorithm s Human-b as ed Algorithms
Physics-based Algorith ms
1. What are Swarm I ntelligence-Ba sed
1. What a re Evo lutionary Algo rithms? 1. What a re H uma n-ba sed Algo rithms?
1. What a re Physics-based Algorithms? Algorithms?
2. When was it develo ped? 2. When was it dev eloped?
2. When was it dev eloped? 2. When wa s it develo ped?
3. What a re some ex amples o f these 3. What a re some ex amples of these
3. What a re some exa mples of these a lgo rithms? 3. What are so me examples o f these
algorithms? algorithms?
a lgo rithms?
REFERENCES:
REFERENCES: REFERENCES:
1. REFERENCES:
1. 1.
1.