Topic: Optimization

problem 1 c is attached here. you can see here

here is the Rest info thats all i have, just do its best.please.

4- Design an algorithm to determine an approximate solution (i.e. the best possible, if not necessarily optimal, solution) for problem 1 (c). 1- Classify the following optimization problems into combinatorial, integer, continuous, and dynamic. Describe the objective function and the constraints (informal description is sufficient): a) Determination of the cheapest train connection from Vienna to Krems from a certain point of departure. b) A painter has 2 models from which he can draw the pictures. For how many hours should he hire each individual model? c) Eight switching units are attached to various positions on a switchboard. The ninth switching unit is to be installed in such a way that the sum of its distances from the other switching units is minimal. d) A baker in Vienna sells various products. How does he find the optimal production plan? e) Electronic control of a lift in a high-rise building. f) You want to renovate your apartment. Here are 5 activities that you can do alone or with the help of a company. g) Lisa wants to look through 12 stores while shopping. In what order does she have to go to them? h) Determination of an optimal move for a given position. i) You go on vacation and decide what things to take with you. j) Determination of an optimal billiard shot for a given position of the ball