Discrete Variables with a Two Bar Truss Design

We are revisiting the two-bar truss problem but with design variables allowed only at discrete values instead of continuous values. In many engineering design problems, the design variables are not continuous but are possible only at select levels known as “discrete” values. These levels may be binary (e.g. 0 or 1), integer (e.g. 5, 6, 7, 8), or at real number values (e.g. 0.05, 0.10, 0.20, 0.50). Recall that we are interested in designing a truss that has a minimum weight, will not yield, will not buckle, and does not deflect "excessively”.


This assignment can be completed in groups of two. Additional guidelines on individual, collaborative, and group assignments are provided under the Expectations link.

Generative AI Learning

Use these prompts to test your understanding after completing the exercise. Direct the AI - it may test your logic, but run the discrete optimization yourself.

"Quiz me with 5 questions, one at a time, on discrete design optimization: why rounding the continuous two-bar truss optimum to the nearest allowed sizes can be infeasible or far from the discrete optimum, how branch and bound uses continuous relaxations to prune the tree, why a relaxation's objective is a bound and what 'fathoming' a node means, how the number of combinations grows with variables and levels (combinatorial explosion), and when exhaustive enumeration is actually the right tool. Grade my answers and list my misconceptions."
"For my discrete two-bar truss: the continuous optimum is {your values}, the rounded design is {your values, feasible or not}, and my discrete optimum is {your values}. Act as a manufacturing-minded reviewer: verify my claim that the rounded design is {feasible/infeasible} by checking the constraints, ask me to quantify the weight penalty of discreteness (discrete optimum minus continuous optimum), and challenge me: for THIS problem with its catalog of allowed values, was branch and bound worth it over checking every combination? Make me do the count."

Tip: This lesson scales to modern practice: topology optimization for additive manufacturing turns 'material or void' in each cell into millions of discrete decisions - the reason practical methods relax the problem to continuous densities first is exactly the relaxation idea in this assignment.

What to Turn In

Submit a short report (PDF, 1-2 pages) that curates your results into a demonstration of what you learned. You may use Generative AI to help write the report, but you must guide it to the correct results, justifications, and assumptions. Answer these questions:

  1. Report the continuous optimum, the nearest-value rounded design (with a feasibility check of every constraint), and the true discrete optimum. Quantify the cost of rounding and the cost of discreteness.
  2. How many discrete combinations exist for your variable levels? How many did your solution method actually evaluate, and why is that a fair measure of branch and bound's value here?
  3. Show the branch and bound logic for at least the first branching decision: the relaxation solved, the bound obtained, and what was pruned.
  4. From the reviewer prompt: what did the AI challenge, and what was your defense?
  5. From the quiz prompt: one question you missed and the corrected answer.

Course Information

Homework

Projects

Activities

Lecture Notes

Extra Content

Related Courses

Admin