Solving Chip Stacking Problems with Lagrange Multipliers

In summary, the individual is seeking help in identifying the correct category of problem (such as Lagrange Multipliers or Simplex method) in order to research and familiarize themselves with the technique. The problem they present involves arranging a number of chips of varying thickness into stacks of equal height, with the measure of "close as possible" being the minimized sum of squares of the difference between actual and nominal stack heights. They also mention the possibility of using a combinatorial technique to solve the problem.
  • #1
cjSlominski
1
0
My math is a little rusty and I want someone to identify the category of problem (Lagrange Multipliers, Simplex method, ...) I have, so that I can read up on the topic and familiarize myself with the technique.

To make the problem simple, let's say I have some number of chips of varying thickness. I want to place these chips in some number of stacks so that the stacks are as close as possible to being the same height. How do I do that?

I'll define "close as possible" as the sum of the squares of the difference between actual stack heights and the nominal stack height is minimized. Note the nominal stack height is the total thickness of all chips divided by the number of stacks.

Thanks,
Chris
 
Mathematics news on Phys.org
  • #2
Sounds awful.
Suppose M is the number of chips, and N the number of stacks you want.
Let [itex]S_{N,i}[/itex] be a set of disjoint subsets of your chips, so that each chip is member of one such subset. i indexes the S-sets.
To each [itex]S_{N,i}[/itex] you may assign a number [itex]L_{N,i}[/itex] which measures how close the stacks are in height.

Thus, you are to compare the [itex]L_{N,i}[/itex] from all [itex]S_{N,i}[/itex], and find the least one.

I'm not sure there will exist a simple formula for this.

Perhaps there exists some clever combinatorial technique to do this effectively regardless of chip thicknesses, but I don't know about it.
 
Last edited:
  • #3


The category of problem being described here is a constrained optimization problem using Lagrange Multipliers. It involves maximizing or minimizing a function (in this case, the sum of squares of differences) subject to certain constraints (in this case, the total thickness of chips and the number of stacks). Using Lagrange Multipliers, we can find the optimal solution that satisfies these constraints and minimizes the objective function.
 

Related to Solving Chip Stacking Problems with Lagrange Multipliers

1. What is the main purpose of using Lagrange multipliers in solving chip stacking problems?

Lagrange multipliers are used to optimize a function subject to a set of constraints. In the case of chip stacking problems, the constraints are typically related to the stability and height of the stack. By using Lagrange multipliers, we can find the optimal solution that satisfies all of the constraints.

2. How does the Lagrange multiplier method work in solving chip stacking problems?

The Lagrange multiplier method involves creating a new function, called the Lagrangian, which includes the original function to be optimized and the constraints as additional terms. By taking the partial derivatives of the Lagrangian and setting them equal to zero, we can find the values of the variables that satisfy both the original function and the constraints.

3. What are the advantages of using Lagrange multipliers in solving chip stacking problems?

One advantage of using Lagrange multipliers is that it allows us to take into account multiple constraints simultaneously, which can be difficult to do with other optimization methods. Additionally, the Lagrange multiplier method is relatively straightforward and can be applied to a wide range of problems, including chip stacking.

4. Are there any limitations or drawbacks to using Lagrange multipliers in solving chip stacking problems?

One limitation of using Lagrange multipliers is that it can only be used for constrained optimization problems. This means that the solution we obtain may not necessarily be the global optimum, but rather a local optimum. Additionally, the Lagrange multiplier method can become computationally expensive for large and complex problems.

5. How can the Lagrange multiplier method be applied to other scientific fields besides chip stacking problems?

The Lagrange multiplier method can be applied to a wide range of problems in various fields, including physics, economics, and engineering. It can be used to optimize functions with multiple constraints, making it a useful tool in many scientific disciplines.

Similar threads

I Exploring the Flexibility of Coordinates in Euler-Lagrange Equations
    • Mechanics
Replies
5
Views
901
MHB Solve Lagrange Multipliers Problem w/ e^(9x) - Find (a,b)
    • Calculus
Replies
2
Views
952
A Lagrange multipliers on Banach spaces (in Dirac notation)
    • Linear and Abstract Algebra
Replies
2
Views
2K
Stationary points classification using definiteness of the Lagrangian
    • Calculus and Beyond Homework Help
Replies
4
Views
868
Lagrange Multipliers / Height of a Rocket
    • Calculus and Beyond Homework Help
Replies
3
Views
2K
MHB Solving Lagrange Multipliers: Find Extrema of Distance from (1,2,3) to Sphere
    • Calculus
Replies
7
Views
2K
A Lagrange multiplier approach to the catenary problem
    • Introductory Physics Homework Help
Replies
5
Views
2K
I Optimization problem with multiple outputs: impossible?
    • General Math
Replies
6
Views
1K
MHB Solve Lagrange Multipliers Problem with x-4y=1 Constraint
    • Calculus
Replies
1
Views
1K
Lagrange multiplier no solution or incorrect formulation
    • Calculus and Beyond Homework Help
Replies
5
Views
3K

Hot Threads

Recent Insights

Back
Top