US 11,960,868 B2
Branch objects for dependent optimization problems
David Benjamin, Brooklyn, NY (US); and Dale Zhao, New York, NY (US)
Assigned to AUTODESK, INC., San Francisco, CA (US)
Filed by AUTODESK, INC., San Francisco, CA (US)
Filed on Jan. 4, 2021, as Appl. No. 17/141,087.
Application 17/141,087 is a continuation of application No. 16/019,439, filed on Jun. 26, 2018, granted, now 10,884,721.
Claims priority of provisional application 62/668,729, filed on May 8, 2018.
Prior Publication US 2021/0124566 A1, Apr. 29, 2021
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 9/44 (2018.01); G06F 3/04817 (2022.01); G06F 8/41 (2018.01); G06F 30/00 (2020.01)
CPC G06F 8/443 (2013.01) [G06F 3/04817 (2013.01); G06F 30/00 (2020.01)] 24 Claims
OG exemplary drawing
 
1. A computer-implemented method for generating a plurality of design solutions, the method comprising:
generating a first branch object that specifies a first optimization problem and a first solver engine;
generating a second branch object that specifies a second optimization problem, a second solver engine, and a dependency between the second optimization problem and the first optimization problem;
executing the first solver engine to generate one or more solutions for the first optimization problem; and
executing the second solver engine to generate one or more solutions for the second optimization problem.