Your privacy, your choice

We use essential cookies to make sure the site can function. We also use optional cookies for advertising, personalisation of content, usage analysis, and social media.

By accepting optional cookies, you consent to the processing of your personal data - including transfers to third parties. Some third parties are outside of the European Economic Area, with varying standards of data protection.

See our privacy policy for more information on the use of your personal data.

for further information and to change your choices.

Skip to main content

Table 3 Total time taken for global solution, number of partitions created during the Branch-and-Reduce algorithm, nonconvex and convex problems solved, and objective function values for both local and global solution methods for the small GMA system.

From: Identification of metabolic system parameters using global optimization methods

 

Time for Global Sol (sec)

No of Partitions

Nonconvex Problems

Convex Problems

Obj fun Value (Global)

Obj fun Value (Local)

0 %

0.252

1

1

1

0.0

0.0

10 %

0.662

1

1

1

0.0

0.0

100 %

1.453

1

1

1

0.0

0.0

200 %

12.005

11

13

11

0.0

0.917

300 %

14.412

13

15

13

0.0

0.884

400 %

10.372

9

11

9

0.0

0.867

500 %

20.042

15

17

15

0.0

0.846