This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Variables and their meanings and bounds : Objective : minimize maximize (circle one) Linear objective function : subject to: (list your constraints) UML CS Algorithms 91.503 (section 201) Spring, 2011 Page 2 of 2 Note : It is acceptable to produce a fractional amount of a book. b) (10 points) Put your formulation from (a) into standard form. c) (10 points) Convert your answer from (b) into slack form. d) (30 points) Using your answer to (c), solve the linear programming formulation of this problem using the SIMPLEX method. Show the optimal value of the objective function and the associated values of the variables. e) (10 points) Form the dual of your answer to (c). f) (10 points) Now, suppose that we fix the number of books in library binding to 5. Solve your linear programming model from (a) (with this additional constraint) using a method of your choice. In your solution, show the value of the objective function and the values of all of the variables....
View
Full
Document
This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.
 Spring '11
 Staff
 Algorithms

Click to edit the document details