Consider the statements:

I. There does not exist a polynomial time algorithm to solve integer linear programming problems.
II. Main focus of PERT is 'minimizing time'.

Choose the correct option about statements I and II.

Statement I:

Integer Linear Programming is a hard problem because variables are restricted to integer values.

General Integer Linear Programming is considered NP-hard.

So, it is not solved by a general polynomial time algorithm.

Therefore, statement I is true.

Statement II:

PERT stands for Program Evaluation and Review Technique.

PERT is mainly used for project scheduling when activity times are uncertain.

Its main focus is time estimation and completing the project in minimum possible time.

Therefore, statement II is true.

So,

I is True and II is True.