For the session on Convex optimization problems, these are selected problems from the reference book: Exercise 4.16: Minimum fuel optimal control. Exercise 4.43: Eigenvalue optimization via SDP. Exercise 4.65: Optimal operation of a hybrid vehicle. Additional problems: Exercise 4.45: Sum-of-squares representation via LMI’s.
Hi everybody, We have some announcements: The second part of Chapter 3 of Boyd, on convex functions, will take place next Tuesday 13th December, 10:30am in the same room (204, IMAG Building). Notice that we (exceptionally) advanced one week because there are vacations afterwards; this will be the final meeting…
Hello everyone ! Here is a list of various information concerning the forthcoming meetings: This Doodle is for the next meeting concerning control theory. It is planned in January (due to holidays!). Please fill it in so that we can schedule it as soon as possible! It will concern the…
In this post we show how to formulate an LP in SageMath, and to solve it with GLPK, a standard open-source mathematical optimization package. A mathematical optimization problem of the form: is known as a linear program (or LP for short), because both the objective and constraint functions are linear.…
