Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Lagrange Multipliers: Problem Solving

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...

Toughness and Hardness of Aggregate

Toughness and Hardness of Aggregate

Toughness and hardness are critical properties of aggregate materials used in concrete, particularly on pavement surfaces and industrial flooring subjected to heavy loads. Toughness is defined as the aggregate's resistance to failure by impact and is measured by the aggregate impact value (AIV). For this, the aggregate impact value test is performed, wherein the impact is delivered by a standard hammer, which falls freely under its own weight onto the aggregates. The aggregates fragment in the...

Lagrange Multipliers: One Constraint

Lagrange Multipliers: One Constraint

In constrained optimization, the objective is to maximize or minimize a quantity while satisfying a fixed condition. A standard example is a rectangular pen built against a barn wall using 100 meters of fencing. Because the wall provides one side of the enclosure, only the other three sides require fencing. The problem is to find the dimensions that produce the greatest possible area.Let L represent the length parallel to the wall and W the width perpendicular to it. The area of the pen is A =...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

A newcomer's guide to deep learning for inverse design in nano-photonics.

Nanophotonics (Berlin, Germany)·2024

Same author

Inspirational Adversarial Image Generation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2021

Same author

Evolutionary algorithms converge towards evolved biological photonic structures.

Scientific reports·2020

Same author

Sparse Zero-Sum Games as Stable Functional Feature Selection.

PloS one·2015

Same author

Comparison-based algorithms are robust and randomized algorithms are anytime.

Evolutionary computation·2007

Same author

Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomography.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2005

Search research articles

Related Experiment Video

Updated: Jul 10, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

On the hardness of offline multi-objective optimization.

Olivier Teytaud¹

¹Equipe-Projet TAO (INRIA Futurs), LRI, UMR 8623 (CNRS - Université Paris-Sud), bat. 490 Université Paris-Sud 91405 Orsay Cedex, France. olivier.teytaud@inria.fr

Evolutionary Computation

|November 21, 2007

Summary

Multiobjective evolutionary algorithms struggle with many conflicting objectives. Research shows their convergence rate is only slightly better than random search when objectives conflict, especially with over three objectives.

Related Experiment Videos

Last Updated: Jul 10, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

Area of Science:

Computational intelligence
Optimization algorithms
Evolutionary computation

Background:

Multiobjective evolutionary algorithms (MOEAs) are widely used for optimization problems with multiple conflicting objectives.
Existing research indicates that MOEAs face scalability challenges as the number of objectives increases.

Purpose of the Study:

To analyze the convergence rate of comparison-based MOEAs concerning the Hausdorff distance.
To compare the performance of MOEAs against random search under specific conditions.
To investigate the impact of the number of conflicting objectives on optimization difficulty.

Main Methods:

Theoretical analysis of comparison-based multi-objective algorithms.
Evaluation of convergence rates using Hausdorff distance.
Modeling computational cost based on the number of comparisons.
Consideration of conflicting objectives and moderate numbers of objectives.

Main Results:

The convergence rate of comparison-based MOEAs is shown to be not significantly better than random search under certain conditions.
The number of conflicting objectives is a critical factor influencing algorithm performance.
Optimization problems with more than three objectives are demonstrably very difficult for these algorithms.

Conclusions:

The scalability of MOEAs is severely limited by the number of conflicting objectives.
Performance benchmarks against random search are relevant for evaluating MOEA efficiency.
Practical implications suggest focusing on problems with fewer than four objectives or developing novel approaches for higher-dimensional multi-objective optimization.