Description
-
For this problem you will solve the Diet Problem.
You will nd the Excel Data (shown in class) on D2L
You should hand in a short report via your favorite document editor. No hand-written work, that includes equations.
Describe the Diet Problem (variables, constraints, const function etc)
Set up (and show your work) the Diet Problem as an LP in Inequality Form:
minimize cT x
subject to Ax b
Solve the LP using only the following matlab LP solving code: linprog(c,A,b) Describe the solution you get.
Play with the problem, as you see t, to get a solution that better ts your diet.
-
Solve the sca olding problem we worked in class.
See separate PDF le for problem statement.
Set up (and show your work) the Diet Problem as an LP in Standard (Equality)
Form:
minimize cT x
subject to Ax = b
x >= 0
Solve the Standard form LP using the linprog function without converting it to any other form. So you’ll have to type \‘help linprog” in the command line to nd out how to do that.
-
This problem is for you to do on your own and not to be turned in: Re-solve 10.2 of Lieven Vandenberghe’s \Additional Excercises” for course UCLA EE133 via the method I explained in lecture… whereby you do not specify a nal value for the masses to meet, but you de ne the constraint that the di erence of the two nal positions must be zero and let the optimization nd the best position for them to meet.
1
