Research Paper Python
Research Paper Python
Research Paper
Submitted by
BACHELOR OF ENGINEERING
IN
COMPUTER SCIENCE
ABSTRACT
Introduction
Optimization seeks to identify the best possible solution from a set of alternatives,
often maximizing desired outcomes or minimizing costs and resource
consumption. It underpins numerous disciplines, including engineering design,
machine learning, economics, and operations research. This paper provides a
comprehensive overview of optimization techniques, equipping readers with a
foundational understanding of this critical field. Imagine standing at a crossroads,
unsure of the best path forward. This scenario isn't limited to literal journeys; it
permeates every decision we make, from resource allocation in businesses to
design choices in engineering. In each instance, we strive to find the optimal
solution, the one that maximizes desired outcomes or minimizes costs and
inefficiencies. This is where optimization techniques emerge as powerful tools,
guiding us towards the most beneficial course of action.
This paper delves into the fascinating world of optimization techniques, equipping
you with the foundational knowledge to navigate complex decision-making
scenarios. We'll explore the core principles of optimization, classical and advanced
methodologies, and the crucial role of problem formulation. By understanding
these concepts, you'll gain the ability to leverage optimization techniques in
various domains, ensuring informed decisions and achieving the best possible
results.
What is optimization?
Optimization technique in the field of engineering is a powerful tool to
utilize the resources in an efficient way as well as to reduce the
environmental impact of a process. Application of optimization process
helps us achieve the most favourable operating conditions.
The primary focus of using optimization techniques is to measure the
Maximum or Minimum value of a function depending on the circumstance.
+LP, linear programming problem: objective f(x) and constrains ci(x) are linear.
+NLP, nonlinear programming problem: f(x) is linear/nonlinear, ci(x):is
nonlinear/linear i.e, one of them is nonlinear.
+ quality constrains represented by numerical values.
+ Inequality constrains represented by related equation.
Most optimization problems are based on steady state models that could be
formulated from experimental data. Optimization problems involving dynamic
models are more suitable for "Optimal control".
control include the outside diameter of the shell, D; tube wall thickness, t; length of
tubes, L; number of passes, N; number of tubes per pass, n; baffle spacing, B, tube
diameter, d. The model calculates the actual steam condensed, m cond, the corrosion
potential, CP, condenser pressure drops, ∆ P cond, cost and overall size, Vcond. The
overall size must be less than V max and the designer would like to limit overall
pressure drop to be less than ∆Pmax.
Optimization Methods:
-Lagrange multipliers
-Successive quadratic programming
-Newton’s method
-Qusi -Newton method
-Levenberg-Marquardt Algorithm
-Simplex Method
-Non-Simplex method
-Secant method
-Genetic Algorithm
- Pattern Search optimization
-Firefly Algorithm
Fig..3. Moving the designer out of the trial-and-error loop with computer-based
optimization software.
The researcher now operates at a higher level. Instead of adjusting variables and
interpreting function values, the designer is specifying goals for the design
problem and interpreting optimization results. Usually, a better design can be
found in a shorter time.
A. Deterministic Methods:
1. Phase-plane method:
Objective space: plot f1(x) against f2(x)
2-Weighting method:
Convert MOO to SOO problem and using the same constraints
Y=w*f1(x) + (1-w)*f2(x)
Where w is a weight factor (0-1)
Even though the weighting method is conceptually straight forward, but choosing
of suitable (w) to find many pareto-optimal solutions is difficult.
3. €-constraints method:
The MOO problem is converted to a SOO problem by using one objective and
converting others into inequality constraints, for example;
Obviously, the user will have to select which objective to be retained and the value
of €. The difficulties in this method are the selection of € value and solving the
optimization problem.