0 Up votes0 Down votes

15 views2 pagesOct 09, 2010

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

15 views

Attribution Non-Commercial (BY-NC)

- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Hidden Figures Young Readers' Edition
- The Law of Explosive Growth: Lesson 20 from The 21 Irrefutable Laws of Leadership
- The Art of Thinking Clearly
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- The Wright Brothers
- The Other Einstein: A Novel
- State of Fear
- State of Fear
- The Power of Discipline: 7 Ways it Can Change Your Life
- The Kiss Quotient: A Novel
- The 10X Rule: The Only Difference Between Success and Failure
- Being Wrong: Adventures in the Margin of Error
- Algorithms to Live By: The Computer Science of Human Decisions

You are on page 1of 2

An assembled item consists of two metal parts. The milling work can be done on different

machines: milling machines, turret lathes, or on automatic turret lathes. The basic data are

available in the following table:

Productivity of the machines

for two parts

Type of machine Number of machines Maximum output /machine /hr

First part Second part

Milling machines 3 10 20

Turret lathes 3 20 30

Automatic Turret lathes 1 30 80

(a) Divide the work time of each machine to obtain the maximum number of completed

items per hour.

(b) Prove that an optimal solution has the property that there will be no slack time on any

of the machines and that equal numbers of each part will be made.

2. If there is a tie for the minimum ratio in a table, then what happens to the basic feasible

solution in the next table?

0

3. Construct a numerical example such that zj − cj > 0 in one table but zj − cj < 0 in the next

table.

Minimize

3x1 + 5x2 + 7x3 + 9x4 + 11x5

Such that 9x1 + 25x2 + 28x3 + 18x4 + 66x5 = 105

xj ≥ 0 ∀j.

Minimize cT x

subject

Pn to

j=1 aij xi = bi ,

xj ≥ 0 ∀j.

(b) Develop a simple test for checking unboundedness.

(c) Develop a simple method for obtaining an optimal solution directly.

6. By using simplex method either obtain a solution or conclude that optimal solution does not

exist for the following problem.

Minimize −x1 − x2

subject to

x1 − x2 − x3 = 1

−x1 + x2 + 2x3 − x4 = 1,

xi ≥ 0, for all i.

Find the value of x1 , x2 , x3 , x4 which will give the value of the objective function as -300.

7. Use the simplex method to give the set of all solutions for the problem

Maximize

1

3x1 + 2x2

subject to

3x1 + x2 + x3 = 9

2x1 + 4x2 ≤ 20,

3x1 + 2x2 ≤ 12,

xi ≥ 0, for all i.

What is the solution of the dual? Is it degenerate?

Maximize

x1 + x2

subject to

x1 + x2 − x3 ≤ 1

x1 − x2 − x4 ≤ 0,

xi ≥ 0, for all i.

Write the basic feasible solutions with the basic variables and the corresponding extreme

points of the feasible set for every table.

Min cT x

subject to

Am×n x = b

x ≥ 0,

by simplex algorithm suppose that in some table zj − cj ≤ 0 for all j = 1, 2, .., n − 1 and

zn − cn > 0. So xn is the only variable which can enter the basis. Also assume that the basic

feasible solution obtained in the next table is non degenerate. Then prove that xn cannot

leave the basis in any subsequent tables and any optimal basic feasible solution will have xn

as a basic variable.

S = {x ∈ Rn : Ax = b, x ≥ 0}

T = {x ∈ Rn : Bx ≤ c}.

(a) Set up an LPP to determine whether S and T have a point in common. Show how to

use the simplex method for determining a separating hyperplane when S and T have no

point in common. That is, find a hyperplane dT x = a such that

dT x < a for all x ∈ S and dT x > a for all x ∈ T.

Can both S and T be unbounded?

- 1 Lecture 1Uploaded byViorel Popescu
- AMCATUploaded byAshish Sethi
- Euler Method in Numerical Analysis PDFUploaded byDawn
- assign3solsUploaded byAvik Mukherjee
- CL 603 - Course HandoutUploaded bywelcometoankit
- Domain - Relational CalculusUploaded bySyedkareem_hkg
- Topic 3aUploaded bySyafiq Hassan
- PS1351 Computational Engineering(Tavio Lecture1)Uploaded byikhsan fahrozi
- lect2Uploaded byAnit Kumar Jain
- SolverUploaded byRickfanWijaya
- BenderUploaded byAmeya Shinde
- Algoritma Program LinearUploaded byAchmed Fajry
- 1. SyllabusUploaded byharsh
- June15 10CS-Is661.pdfUploaded byShivaJunveer
- sUploaded bySon Hoang
- AOR-01_EUploaded byDevKumar
- Master Theorem Change of VarsUploaded byDaniel Maximus Bridges
- chapter 1Uploaded byJo An Valdez
- Problem Set No 1 2013-2014Uploaded byFerdinand Fragata Ramiterre
- Slides05 Multigrid.pdfUploaded byAbdullah Ilyas
- Discrete Structures.pdfUploaded byjadad
- 229 4.5 DeterminantsUploaded byMas Gund
- Chapter 1 FunctionUploaded byYoke Kean Ng
- Chandpur Entreprises SimplexUploaded byCuriosity Killer
- fft paperUploaded byChinmayGharat
- _L06Uploaded byEddie Tang
- 1 Introduction.pdfUploaded byAlizandria Casumbal Danao
- L2_Piv_partiala_engUploaded byCristi Pîrlac
- FEM Lecture4Uploaded bysanjay
- ComputationalUploaded byUmang Jain

- The Nine Pillars of Successful Weight LossUploaded bya920a79c
- DWDM Viva QuestionUploaded byUpendra Reddy
- TEN Newsletter Autumn 2010v2[1]Uploaded byPeer Coach Academy Colorado
- narrative textUploaded byDines Yikwa
- 9789241512725-eng.pdfUploaded byNorma Yanti
- Renesas Sensorless Vector Control (Pag 13)Uploaded byrusuraduionel22
- Articulo La Musica DeByrd Transcrita Por Sus ContemporaneosUploaded bycapaustral
- Batson challenge transcript in Smith v. JonesUploaded bysandydocs
- BSBA-MktgMgmt-2014Uploaded byKeeana Meneses
- Nursing Handoffs a Systematic Review of the.26Uploaded byZoa Ng Wai Kwan
- 16 TeoriUploaded bygalih dwitama
- Anc Health Plan 1994Uploaded byGodfred Takyi
- Icici Marketing.1Uploaded byKurianPunnoose
- kamus geotechnicalUploaded byjajayusman
- MCWP 6-11 Leading MarinesUploaded byCharles Harris
- Year2010 Our Lady Queen of Peace Anguera Bahia BrazilUploaded bylastdaysdouglas
- Lesson Plan 1Uploaded bysaralynn83
- Are We Ready to Get on the Chariot Sermon and Outline by Charles a. YawnUploaded byCharles A. Yawn
- hd 390 evidence social action projectUploaded byapi-323009558
- 20 Romanian WritersUploaded byMonica Loloiu
- Journal readingUploaded byMuhammad Rhema Adinegara
- WayToEng1_EP_2-1Uploaded byCinta Acosta Rodriguez
- Regresi Multi StageUploaded bystevengerrardi6099
- Intelligent Information SystemsUploaded byCheli Olvera
- Final Research Paper.docUploaded byFarhana Jabin
- 03_2009Uploaded byroccospike
- Analyzing Esxtop DataUploaded byNasron Nasir
- 6.0.1.2 Leaving on a Jet Plane Instructions IG.pdfUploaded byMaksim Korsakov
- Own Cloud Admin ManualUploaded byLeonardo Ramirez
- Common Parasitic Diseases of CamelUploaded byYaserAbbasi

## Much more than documents.

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

Cancel anytime.