Goal programming: a. is not an iterative solution procedure. b. requires the use of only hard constraints. c. involves solving problems containing a collection of goals that we would like to achieve. d. requires firm rhs values of the constraints.

c. Involves solving problems containing a collection of goals that we would like to achieve.

Explanation:

To solve this question we first need to understand what Goal Programming is. Goal Programming is basically an optimization technique which aims to solve decision problems with multiplicity of objectives. It is an extension of linear programming. Hence the answer is C

the minimum constant speed at which she can catch the train is 2.7 m/s

given:

acceleration = 0.6

time = 4.5 s

to find:

velocity = ?

formula used:

from 1st kinematic equation we get,

v = u + at

u = initial speed of train = 0 m/s

v = final speed of the train

a = acceleration of the train

t = time

solution:

from 1st kinematic equation we get,

v = u + at

u = initial speed of train = 0 m/s

v = final speed of the train

a = acceleration of the train

t = time

v = 0 + (0.6 × 4.5)

v = 2.7 m/s

the minimum constant speed at which she can catch the train is 2.7 m/s