0 Up votes0 Down votes

1 views5 pagesOr

May 09, 2018

© © All Rights Reserved

PDF, TXT or read online from Scribd

Or

© All Rights Reserved

1 views

Or

© All Rights Reserved

- Lecture 0
- Exercise 411
- Executive Summary
- 1994 Discrete Charms
- Design and Optimization of Multipass Heat Ex Changers
- dataleakagedetection123-131216094254-phpapp01
- Chapter 2
- Post Optimality
- 1-s2.0-S0168874X12000807-main
- OPTIMAL MACHINE REPLACEMENT STRATEGIES USING DYNAMIC PROGRAMMING RECURSIONS: A CASE STUDY OF NASCO HOUSEHOLD PRODUCTS LTD., JOS
- An Optimal Swarm Intelligence Approach For Test Sequence Restructuring To Conserve Power Usage In VLSI Testing
- Genetic_Synthesis_Techniques_For_Low_Power_Digital_Signal_Processing_Circuits.pdf
- Power System
- NLSC Lecture Notes 2016 Sufficient Conditions Chapter
- Mon 17.30 Predictive Control Down at Plc Level Rossiter
- Article1Borndr_ferGr_tschelPfetsch
- 01707402.pdf
- Course Descriptions _ Courses & Curriculum _ Academics _ Industrial & Systems Engineering _ College of Engineering
- Analysis of Space Trusses by Difference Equations
- VMOD_MGODewater_Tutorial.pdf

You are on page 1of 5

STOR 612

Please only use the paper given by the instructor. In LP formulations, do not make

assumptions based on the problem data (ie. since product 1 is cheaper than product

2, we will not make any of product 1, etc.), even in the unlikely case that this would

be possible.

f (α) = max { α, 2α − 3, 6α + 5 }

g(α) = max { α + 1, 3α + 5, 7α + 5 }

h(α) = min { α + 2, 3α + 7, 8α + 10 }.

column vector d. From the following list of optimization problems, identify the ones

that can be formulated as an LP based om what we covered in class.

say this, and give the formulation. Use the minimum number of variables up to a

constant factor (i.e. using 2k instead of k is OK; but using k 2 instead of k will not

receive full credit.) Make sure that all inequalities are in the correct direction. No

proof of correctness is necessary.

1. Pk

max f (ai x)

Pi=1

k

s.t. i=1 g(bi x) ≤ δ

Ax ≤ d.

Solution We cannot do this. We could represet the constraint, but not the

objective.

2. Pk

min f (ai x)

Pki=1

s.t. i=1 g(bi x) ≤ δ

Ax ≤ d.

1

Use variables z1 , . . . , zk ; s1 , . . . , sk . The LP is

Pk

min i=1 zi

s.t. zi ≥ ai x, ∀i

zi ≥ 2ai x − 3, ∀i

zi ≥ 6ai x + 5 ∀i

P

i si ≤ δ

si ≥ bi x + 1 ∀i

si ≥ 3bi x + 5 ∀i

si ≥ 7bi x + 5

Ax ≤ d.

3. Pk

min f (ai x)

Pi=1

k

s.t. i=1 g(ai x) ≥ δ

Ax ≤ d.

Solution We cannot do this. We could represet the objective but not the con-

straint.

4. Pk

min f (ai x)

Pi=1

k

s.t. i=1 h(bi x) ≥ δ

Ax ≤ d.

Use the same zi and si as before, represent the objective as before, and the

constraint as

X

si ≤ bi x + 2, 3bi x + 7, 8bi x + 10 ∀i and si ≥ δ.

i

5. Pk

max h(ai x)

Pi=1

k

s.t. i=1 g(bi x) ≤ δ

Ax ≤ d.

Represent the constraint as before, and the objective as

X

max zi , zi ≤ 2bi x + 2, 3bi x + 7, 8bi x + 10 ∀i.

i

6. Pk

min h(ai x)

Pi=1

k

s.t. i=1 g(bi x) ≤ δ

Ax ≤ d.

We cannot do this.

2

Question 2 (20 points) Let R be a return matrix, with m rows, and n columns, with

components Rij , where Rij is the return on 1 dollar invested in stock j in scenario i.

Denote by pi (i = 1, . . . , m) the probability of scenario i happening. Let x be a

portfolio, i.e., x is a nonnegative n-vector, whose components sum to 1, with xj equal

to the amount invested in stock j.

1. Define the expected return of portfolio x, and the average downside risk.

2. Given a δ scalar, formulate the problem of maximizing the expected return subject

to the ADR being ≤ δ, as a linear program. What is the maximum expected

return that can be achieved, if we want the ADR to be zero?

Question 3 (15 points) A cargo plane has three compartments for storing cargo:

front, center, and back. These compartments have capacity limits, as follows: front, 12

tons; center, 18 tons; back, 10 tons.

The following three types of cargo have been offered for shipment on an upcoming

flight:

1 20 320

2 16 400

3 25 360

Any portion of these cargoes can be accepted; i.e. from cargo 1 we can take any

amount between 0 and 20 tons. The objective is to determine how much (if any) of

each cargo should be accepted, and how to distribute each among the compartments

to maximize the total profit for the flight.

To maintain balance of the airplane, the weight loaded into the back must be be-

tween 45 and 55 % of the weight loaded into the center. Also, business considerations

dictate that at least 20 % of all accepted cargo by weight must be cargo 1; and the

total weight of accepted cargoes 1 and 2 must not exceed the weight of accepted cargo

3 by more than 20 %.

Formulate a linear programming problem to determine how many tons of each cargo

to ship to maximize profit (do not attempt to solve). Describe the meaning of each

constraint.

Solution Let us call the front, center, and back compartments 1, 2, and 3, respec-

tively.

• Variables: x11 is the amount (in tons) cargo 1 put into compartment 1; x12 is

the amount (in tons) of cargo 1 put into compartment 2; etc.

• Objective: Maximize 320x11 + 320x12 + 320x13 + 400x21 + 400x22 + 400x23

+360x31 + 360x32 + 360x33

3

• Constraints: For the availability of the cargoes:

x21 + x22 + x23 ≤ 16;

x31 + x32 + x33 ≤ 25;

x12 + x22 + x32 ≤ 18;

x13 + x23 + x33 ≤ 10;

x13 + x23 + x33 − 0.55x12 − 0.55x22 − 0.55x32 ≤ 0

x13 + x23 + x33 ≥ 0.45(x12 + x22 + x32 ); which is the same as

x13 + x23 + x33 − 0.45x12 − 0.45x22 − 0.45x32 ≥ 0.

x11 + x12 + x13 ≥ 0.2(x11 + x12 + x13 + x21 + x22 + x23 + x31 + x32 + x33 );

The total weight of accepted cargoes 1 and 2 must not exceed the weight of

accepted cargo 3 by more than 20 %:

Question 4 (20 points total) Consider the following production process model below.

Please describe an LP to find the production plan that yields maximal profit.

AND 4 oz of product 2.

1/3 oz of product 4 (this means we can make quantities in between.)

4

• Product 2 and product 4 can be blended to make product 5. x oz of product 2

and y oz of product 4 will make x + y oz of product 5. Between 20 and 30 % of

product 5 must be of product 2.

• Any portion of any product can also be directly sold; 1 oz of product i sells for

pi dollars.

- Lecture 0Uploaded by_MerKeZ_
- Exercise 411Uploaded bySusie Kimport
- Executive SummaryUploaded bysureniitr
- 1994 Discrete CharmsUploaded bymshchetk
- Design and Optimization of Multipass Heat Ex ChangersUploaded byFelipe Resendiz Nuñez
- dataleakagedetection123-131216094254-phpapp01Uploaded byQ-mar Nair
- Chapter 2Uploaded byFickri Hafriz
- Post OptimalityUploaded byAbdulaziz Alzahrani
- 1-s2.0-S0168874X12000807-mainUploaded bycarlosdayana
- OPTIMAL MACHINE REPLACEMENT STRATEGIES USING DYNAMIC PROGRAMMING RECURSIONS: A CASE STUDY OF NASCO HOUSEHOLD PRODUCTS LTD., JOSUploaded byMohammed Hamed
- An Optimal Swarm Intelligence Approach For Test Sequence Restructuring To Conserve Power Usage In VLSI TestingUploaded byseventhsensegroup
- Genetic_Synthesis_Techniques_For_Low_Power_Digital_Signal_Processing_Circuits.pdfUploaded byDeepa Yagain
- Power SystemUploaded byRajat Seth
- NLSC Lecture Notes 2016 Sufficient Conditions ChapterUploaded bysalim
- Mon 17.30 Predictive Control Down at Plc Level RossiterUploaded byquinteroudina
- Article1Borndr_ferGr_tschelPfetschUploaded byPK
- 01707402.pdfUploaded byBasil
- Course Descriptions _ Courses & Curriculum _ Academics _ Industrial & Systems Engineering _ College of EngineeringUploaded byPallav Anand
- Analysis of Space Trusses by Difference EquationsUploaded byMohamed Elfawal
- VMOD_MGODewater_Tutorial.pdfUploaded byPipe Ignacio AG
- Cktsung 39 PaperUploaded byJuan Manuel Romero
- Formulation of a Combined Transportation and Inventory Optimization Model with Multiple Time PeriodsUploaded byAnonymous 7VPPkWS8O
- mmmmcsUploaded byMaharaja Girsang
- optimization labUploaded byapi-309621828
- Document 12Uploaded byTarak Benslimane
- 09 - SA5 Analysis of NGMN Requirement 9 - LTE Parameter Optimization (1).pptUploaded bypedro
- Econ 162 2nd Semester 2017 NotesUploaded byAnonymous 5CZKL0P
- Ricci Distributions EnUploaded byDavid Esteban Meneses Rendic
- ArticuloUploaded byScorpion1985
- 05 Transportation & Transshipment Models (Complete)Uploaded byAdeel Asghar

- Engineering Mechanics of Solids PopovUploaded byvikas kumar singh
- m Fl 69446160Uploaded byKushal Bn
- 1902119039.pdfUploaded byKushal Bn
- Drilling.pdfUploaded byاحمد عمر حديد
- assignment01_solnUploaded byKushal Bn
- RecruitmentUploaded byakash islawat
- productattachments_files_GATE_Mechanical_Engineering_Set_2_2018.pdfUploaded byKushal Bn
- productattachments_files_GATE_Mechanical_Engineering_Set_2_2018.pdfUploaded byKushal Bn
- Notification UPSC IFS Prelims ExamUploaded byKiranmai Kittu
- ESE CE 2016 Sol P I IES Master.pdfUploaded bySivasutha007
- 2_1 (1)Uploaded byKushal Bn
- gear introductionUploaded byAnkesh Ghoghari
- 78-SSUploaded byKushal Bn
- Design of Machine Element-IIUploaded byKushal Bn
- 612_e1_2014_wsol (1)Uploaded byKushal Bn
- AJSAT Vol.3 No.2 July-December 2014.pdfUploaded byKushal Bn
- Timoshenko.engineering MechanicsUploaded byKushal Bn

- Math 6-12 FloridaUploaded byBinny Sharma
- What's a Compound InequalityUploaded byArturo Sierra
- Solution of Final Exam Fall_2015 (2)Uploaded byالعلم نور
- Maximum and Minimum ValuesUploaded byGloria Taylor
- Adomain Decomposition Method for ∅4 Klein Gordon EquationUploaded byInternational Journal of Engineering Inventions (IJEI)
- MAC101_Chap6Uploaded byChuc Nguyen
- LINEAR PRIME LABELING OF SOME DIRECT CYCLE RELATED GRAPHS.Uploaded byIJAR Journal
- OnlineCalcIIIsyllabus_June2014Uploaded byWillLow1
- Electronics and communicationUploaded byNishant Saxena
- Calculus 06 Applications of the DerivativeUploaded byDesirée López Palafox
- Stiffness Matrix MethodUploaded byfatabass
- Grade 11 General MathUploaded byA.M.A
- inequalities unit day 2Uploaded byapi-215517770
- 06477225Uploaded byJuan Manuel Mauro
- STPM Semester 2 mid term exam - Mathematics TUploaded byLoo Siaw Choon
- CCGPS Math 8 8thGrade CurrimapUploaded byScott Pate
- Cosmological perturbation theory, part 1 - Hannu Kurki.pdfUploaded byherkike01
- Scientia Magna international journal, Vol. 5 No 1Uploaded byAnonymous 0U9j6BLllB
- s&nmUploaded byKumar Ramalingam
- Matrix CalculusUploaded bystd_iut
- Gallagher, Isabelle - From Newton to BoltzmannUploaded byAdrian
- Hoffman Kunze Linear Algebra Chapter 3 5 3 7 SolutionsUploaded bySuyash Date
- Non Singular Univ EseUploaded byjaime
- ECE 495N Lecture 8 - Schrodinger Equation and Finite DifferenceUploaded byTheodore Chandra
- Rotational Motion 2009 7Uploaded byJulian Bermudez
- CH - 04 TRANSFER FUNCTION APPROACH V-06.pdfUploaded byKld Hamed
- IntegersUploaded byashi1564
- febook-module1Uploaded byManoj Mahendran
- partial derivativesUploaded byEduard Albay
- A Numerical Tour of Signal Processing_ Image Denoising With Linear MethodsUploaded byNazeer Saadi

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.