Related Experiment Video

Updated: Oct 1, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Genetic programming over context-free languages with linear constraints for the knapsack problem: first results

Peter Bruhn1, Andreas Geyer-Schulz

  • 1Department of Information Business, Vienna University of Economics and Business Administration, Austria. Peter.Bruhn@wu-wien.ac.at

Evolutionary Computation
|April 4, 2002
PubMed

Related Concept Videos

Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
Lagrange Multipliers: Problem Solving01:30

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...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems01:26

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 Constraints01:28

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.