assignment1-1 - , compatible with the model prod.mod . Then...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ORIE 3300/5300 ASSIGNMENT 1 Fall 2011 Due: 11am, Tuesday September 6. This assignment is individual work. 1. Read pages 2–11 of the AMPL book. 2. The Student Edition of AMPL on the AMPL website includes a MODELS folder containing many useful models. Read through the file prod.mod : this question asks you to use this model to solve a particular linear program. An oil refinery can produce 3 types of gasoline: “Regular”, “Plus”, and “Ultra”. It can produce Regular at 10000 gallons per hour, for a profit of 10 cents per gallon, or Plus at 9000 gallons per hour, for a profit of 11 cents per gallon, or Ultra at 8500 gallons per hour, for a profit of 12 cents per gallon. The refinery operates 24 hours a day, and can ship at most 120000 gallons of each type of gasoline each day. We wish to maximize profit. Specify this problem in an AMPL data file called smog.dat
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , compatible with the model prod.mod . Then use AMPL to solve the problem. Print out your data le and AMPL output. 3. Consider the following linear program. maximize 9 x 1 + 8 x 2 subject to x 1-x 2 2 3 x 1 + x 2 10 x 1 + 2 x 2 10 x 1 , x 2 . Find the optimal solution graphically. By adding together suitable multiples of the constraints, prove algebraically that your answer is indeed optimal. 1 4. For each of the following linear programs, decide graphically whether the problem is infeasible, unbounded, or has an optimal solution. Then explain algebraically why your answer is correct. (i) maximize-x 2 subject to x 1 + x 2 1 x 1-x 2 -3 x 2 1 (ii) maximize-x 2 subject to x 1 + x 2 1 x 1-x 2 -3 x 2 1 (iii) maximize x 2 subject to x 1 + x 2 1 x 1-x 2 -3 x 2 1 2...
View Full Document

Page1 / 2

assignment1-1 - , compatible with the model prod.mod . Then...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online