340 views

Uploaded by Kaizen188

save

- Relevant Costing
- Worked_Examples_03.doc
- Weather Wax Bertsimas Solutions Manual
- MGS 8140 Syllabus - Jim Shi - Spring 2011
- MIT15_053S13_ps1-2sol
- m tech syllabus for thermal engineering
- ejercicios io
- form5chap21
- Aggregate Planning in a Supply Chain
- chap_2A
- Linear Programming
- lp_ass
- MTE-12
- Financial Instability From Local Market Measures_2012_Paper
- Free Math Problem Solver
- ijaer
- Linear Programing
- Revised Group 1 Report
- 22trans3
- 07Simplex3B
- 182
- DISC 212-Introduction to Management Science-Muhammad Adeel Zaffar
- Waterfall Excel Charts
- TCN J14 A0
- Exemplu Paper Cu Algorithm
- Delay Robustness Mirkin
- 05 LP III Handout
- Blockbook GT&O 1516
- ele2
- ieee journal
- Sapiens: A Brief History of Humankind
- Yes Please
- The Unwinding: An Inner History of the New America
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- Dispatches from Pluto: Lost and Found in the Mississippi Delta
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- John Adams
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America
- Grand Pursuit: The Story of Economic Genius
- This Changes Everything: Capitalism vs. The Climate
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story
- The Emperor of All Maladies: A Biography of Cancer
- The Prize: The Epic Quest for Oil, Money & Power
- Team of Rivals: The Political Genius of Abraham Lincoln
- The New Confessions of an Economic Hit Man
- The World Is Flat 3.0: A Brief History of the Twenty-first Century
- Rise of ISIS: A Threat We Can't Ignore
- The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers
- Smart People Should Build Things: How to Restore Our Culture of Achievement, Build a Path for Entrepreneurs, and Create New Jobs in America
- How To Win Friends and Influence People
- Angela's Ashes: A Memoir
- Steve Jobs
- Bad Feminist: Essays
- The Light Between Oceans: A Novel
- The Silver Linings Playbook: A Novel
- Leaving Berlin: A Novel
- Extremely Loud and Incredibly Close: A Novel
- The Sympathizer: A Novel (Pulitzer Prize for Fiction)
- You Too Can Have a Body Like Mine: A Novel
- The Incarnations: A Novel
- Life of Pi
- The Love Affairs of Nathaniel P.: A Novel
- A Man Called Ove: A Novel
- The Master
- Bel Canto
- The Rosie Project: A Novel
- The Blazing World: A Novel
- We Are Not Ourselves: A Novel
- The First Bad Man: A Novel
- Brooklyn: A Novel
- The Flamethrowers: A Novel
- The Art of Racing in the Rain: A Novel
- Wolf Hall: A Novel
- The Wallcreeper
- Interpreter of Maladies
- The Kitchen House: A Novel
- Beautiful Ruins: A Novel
- The Bonfire of the Vanities: A Novel
- Lovers at the Chameleon Club, Paris 1932: A Novel
- The Perks of Being a Wallflower
- A Prayer for Owen Meany: A Novel
- The Cider House Rules
- Ordinary Grace: A Novel

You are on page 1of 5

**1. Singapore Airlines operates a hub at the Changi International Airport. During the second
**

quarter, the airline schedules 7 flights daily from Singapore to Hong Kong and 10 flights

daily from Hong Kong to Singapore, according to the following schedule:

Flight Leave

The flight crews live in Singapore or Hong Kong, and each day a crew must fly one flight

from Singapore to Hong Kong and one flight from Hong Kong to Singapore. A crew must

return to its home city at the end of each day. For example, if a crew originates in Hong

Kong and flies a flight to Singapore, it must then be scheduled for a return flight from

Singapore back to Hong Kong. A crew must have at least 1 hour between flights at the city

where it arrives. Thus, some scheduling combinations are not possible. For example, a crew

on flight 1 from Singapore cannot return on flights A, B, or C from Hong Kong. It is also

possible for a flight to ferry one additional crew to a city in order to fly a return flight, if there

are not enough crews in that city.<interpretation: e.g. if there’s not enough sg crews to fly the

return flight from hk to sg, the company can insert one more crew into one of the outbound

flight in order to fill the gap for the returning flight.>

The airline wants to schedule its crews in order to minimize the total amount of crew ground

time (i.e. the time the crew is on ground between flights). Excessive ground time for a crew

lengthens its workday, is bad for crew morale, and is expensive for the airline.

Formulate a linear programming model to determine a flight schedule for the airline.

(Hint: use to represent the number of crews take Flight i first and return by Flight j.)

__________________________________________________________________________

Let

**to represent the number of crews take Flight i first and return by Flight j.
**

to represent the ground time between the Flight i first taken and return by Flight j.

Min

∑, ,

,

,

∑ ≥ 1. s. ∑ ≥ 1 ∑ .t.. . ∑ ≥ 1.

∑ ≥ 1 ∑ . ∑ ≥ 1. ≥ 1.

∑ . ≥ 1.

∑ ≥ 1. ∑ ≥ 1 ≥ 0 and . ≥ 1 ∑ ≥ 1.

min = + 3 + 5 + 6 + 9 + 10 + 12 + + 3 + 4 + 7 + 8 + 10 + 2 + 3 + 6 + 7 + 9 + + 3 + + 6.

+ 8.

+ 10.

+ 11.

) s.t. + 5 + 7 + 9 + 10 + 4 + 6 + 8 + 9 + 2 + 4 + 6 + 7 + 2 + 4 + 5 + 2 + 3 + + 2 (Impossible schedule combinations have already been withdrawn from the equation. + + + + + + ≥ 1 + + + + + ≥ 1 + + + + ≥ 1 .

+ .

+ .

+ .

≥ 1 + + + ≥ 1 + + + ≥ 1 + + .

+ + + ≥ 1 + .

+ + + + ≥ 1 + + + + ≥ 1 + + + + ≥ 1 + + + + ≥ 1 + + + + ≥ 1 .

+ + + + + + ≥ 1 .

…… ≥ 0. + + + + + + ≥ 1 + + ≥ 1 + + + ≥ 1 + + + + ≥ 1 and ≥ 0. . Ans: = 1. = 1. = 1. ≥ 0. = 1. = 1.

= 1 Total amount of crew ground time= + + 6 + + + 6. = 1. = 1. = 1. = 1.

t. ≥ 0 . Consider the problem Minimize 2 + 3| −10 | s. 3 − 30 ≥ −. | + 2 | + | | ≤ 5. + + 2 ≤ 5 ≥ −2. = − 10 Adding additional constraints s. __________________________________________________________________________ Let . Reformulate it as a linear programming problem and also present it in the standard LP form. + 5 + 4 + + 3 = %& '()*+ for a total of 10 crews 2. 3 − 30 ≤ .t.

∑ 7 5 ≥ 6 . | |. The illumination 6 of the i th segment is assumed to be ∑8 7 5 .2 . 6 ∗ .. ≥ 0 Ans: / = 11.1 − .2 ) . Hence.2 + . Provide a reasonable linear programming formulation of this problem. = Problem becomes Min 2 + 3|. s.2.2 . Our objective is to get close to the desired illumination.1 + .2 = + 2 . Note that the wording of the problem is loose and there is more than one possible formulation. | ≤ 5 s. . the problem becomes Min ∑8 where < = 1. becomes Min s.3. 2 + 3(.Min: s. The higher the power of the lamp.1 + .t. − − − 2 ≥ −5 ≥ −2. Thus it is reasonable to think that we’ll try to minimise the lamp power if possible. . 2 + 3. . ∑8 7. . 30 − 3 ≥ −. = + 2. = −2.e.t. >. ∗ where 7 are known coefficients. = 5 To present in standard LP form. Consider a road divided into n segments that is illuminated by m lamps. | = . … . ∗ ∑8 7 5 ≥ 6 8 8 ∗ ∗ ∗ ∑8 7 5 ≥ 6 .2 Therefore.2 ≤ 5 . the higher the costs incurred. In this case.1 − . 6 ∗ = 6 ∗ = ⋯ = 6 ∗.t. 5 . | + |. = . = − 10. ___________________________________________________________________________ Assumptions made: The desired illumination 6 ∗ is the same for all roads.2 .. ∑ 7 5 .1 . Let 5 be the power of the j th lamp. To eliminate absolute. 5 ≥ 6 . .2 = − 10 . . i. . 7 5 8 8 ∑ 7 5 .1 . Let .1 − . = 6 ∗ .2 = . sub |. ∑ 7.1 + .1 − .….. We are interested in choosing the lamp powers 5 so that the illuminations 6 are close to the desired illumination. .1 .2 . ..t. we assume that the ith segment of the road needs to be adequately lit-up and the desired illumination is the minimum requirement. ≥ 0 3. . Let 6 be the desired illumination of road i. 3 − 30 ≥ −.….1 + .

(b) Assume that the optimal cost is finite. >. 58 ≥ @. 7 = G ≥ 0. .…. then the LP is not feasible. develop a simple method for obtaining the optimal solution directly.and 5 ≥ @ where A = 1. … . If a non zero artificial variable exists at the end. Ans: K = −LM b) Minimize s. + 2. H s. . < = 1. − + ≤ −2 2 + 3 ≤ 5 . N 5. Write the dual for each of the following primal problems: (a) Maximize / = −5 + 2 s.t.3. ___________________________________________________________________________ a) Check for feasibility of LP using a 2-phased Simplex Method. ≥ −5 . . a) Minimize s.. ≥ 2 . (a) Derive a simple test for checking the feasibility of this problem. ≥ 0 / = + <C − D + C − D > 2 + = 5 <2C − 2D + C − D ≤ 5 > <−2C + 2D − C + D ≤ −5 > 3 − = 6 <3C − 3D − C + D ≤ 6 > <−3C + 3D + C − D ≤ −6 > . 5 ≥ @. ≥ 0 (b) Maximise s. / = 57 − 5G + 67 − 6G 27 − 2G + 37 − 3G ≥ 1 −27 + 2G − 37 + 3G ≥ −1 7 − G − 7 + G ≥ 1 −7 + G + 7 − G ≥ −1 Ans: K = %.t. . Consider the following LP with a single constraint: Min ∑. . B. ∑. + 5. 5 ≥ @. unrestricted <every C7EDF @ GF H@>CFIFJ @ C − D > ___________________________________________________________________________ / = −2.2. … . + 3.t. 4. −.t. Construct the Simple Phase 1 tableu.t..

D .b) Substitution of constraint equation into objective equation as it is an equality equation.3. ≥ 0 b) + + + ⋯ .2. n) takes the value of 1.5.3. .Q Max ∑. B . >) /≤1 d) / ≤ (< = 1.. n) takes the value of zero. 2. then z takes a value of 0. Let O be the utilities derived from the assignment of school/student.S + ∑S. . … . G .. Where < = 1 − 8. ∑R S = 1 ………… ∑R S Q = 1 ∑Q S = 1 ………… ∑Q R = 1 ∑Q S = 1 ………… ∑Q R = 1 ∑R S = 1 ………… ∑R S Q = 1 Ans: A . H . … . . Let . .6. (b) If all the s take the value of zero. _____________________________________________________________________________ a) / ≥ (< = 1...1.R R. i. E . … . F .t.3. Q. 6.e. (c) z takes the value of 1 if all the s take the value of 1. O − P. then z takes a value of 0.. . . be n binary variables and let z be some other binary variable. A = 1 − 8.7. ≥ / /≥0 c) / ≥ (< = 1. … .. s.2.4.8.. O − P. 2.. . (d) If any (i = 1. >) /≤1 + + + ⋯ .. .3.2.2. >) /≥0 7. write linear constraints so that (a) z takes the value of 1 if at least one of the s (i = 1. ≥ / . C . Formulate the logical operator by using integer linear program. ..

- Relevant CostingUploaded byLeovieh Espocia Balanza
- Worked_Examples_03.docUploaded byGaurav Kumar
- Weather Wax Bertsimas Solutions ManualUploaded bychencont
- MGS 8140 Syllabus - Jim Shi - Spring 2011Uploaded bymasrawy2015
- MIT15_053S13_ps1-2solUploaded byErkin Koray
- m tech syllabus for thermal engineeringUploaded bywaku74
- ejercicios ioUploaded byYamileth Possu Jimenez
- form5chap21Uploaded byAlexey Yagudin Wong
- Aggregate Planning in a Supply ChainUploaded byThiru Venkat
- chap_2AUploaded byTarunjeet Singh
- Linear ProgrammingUploaded byJustin Pagalilauan
- lp_assUploaded byAJay
- MTE-12Uploaded byVipin
- Financial Instability From Local Market Measures_2012_PaperUploaded byGallo Solaris
- Free Math Problem SolverUploaded bycircleteam123
- ijaerUploaded byAnonymous WtjVcZCg
- Linear ProgramingUploaded byLuis Ivan
- Revised Group 1 ReportUploaded byNico Aldrin Faustino
- 22trans3Uploaded byPotnuru Vinay
- 07Simplex3BUploaded byPotnuru Vinay
- 182Uploaded byebenesarb
- DISC 212-Introduction to Management Science-Muhammad Adeel ZaffarUploaded byHaris Ali
- Waterfall Excel ChartsUploaded byGiriMaha
- TCN J14 A0Uploaded byabhijit1729
- Exemplu Paper Cu AlgorithmUploaded byMircea Bujor
- Delay Robustness MirkinUploaded byJohnv13
- 05 LP III HandoutUploaded byshotorbari
- Blockbook GT&O 1516Uploaded byAnonymous pKeA42
- ele2Uploaded bygeniuspro2014
- ieee journalUploaded byAarthi Devpal