15 views

Uploaded by Praveen Alevoor

- GSL_BSplinesHelp
- Function IIT JEE
- Post Optimality
- TransportationModel Handout1 Introduction NWCM MMCM
- Simplex Method Ex
- Simplex Method
- dddd
- Solutns ofLP
- 1017_sol
- Operational Research Assignment
- NumMeths Outline
- 10 - Sugeno-TSK Model
- Simplex1
- c03 Lp Methods
- Advanced Microeconomics – Assignment 1
- New Book
- import java.docx
- lec7
- Incr Decr Seq
- Distribution network reconfiguration for loss reduction using fuzzy controlled evolutionary

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?

- GSL_BSplinesHelpUploaded bytzotz
- Function IIT JEEUploaded byKumar Sujeet
- Post OptimalityUploaded byAbdulaziz Alzahrani
- TransportationModel Handout1 Introduction NWCM MMCMUploaded byM Yasin Memon
- Simplex Method ExUploaded bySuresh Cr
- Simplex MethodUploaded byNoor Shafiqaryana Mohammad
- ddddUploaded byAnonymous N3LpAX
- Solutns ofLPUploaded byPhool Mohammad Rayeen
- 1017_solUploaded byAdil Shahzad
- Operational Research AssignmentUploaded byRahul Sinha
- NumMeths OutlineUploaded bysunnyopg
- 10 - Sugeno-TSK ModelUploaded byAchu
- Simplex1Uploaded byDhivya Ramachandran
- c03 Lp MethodsUploaded byMarissa Marissa
- Advanced Microeconomics – Assignment 1Uploaded byrethmlai7516
- New BookUploaded byJessica Angelina
- import java.docxUploaded byvijay
- lec7Uploaded byHenrique Mariano Amaral
- Incr Decr SeqUploaded bysrivatsan_vn
- Distribution network reconfiguration for loss reduction using fuzzy controlled evolutionaryUploaded byapi-3697505
- MELJUN CORTES CSCI08_SYLLBUSUploaded byMELJUN CORTES, MBA,MPA
- 9. Decision-making Coordination and Efficient ReasoningUploaded byMiguel Cuya
- Ex 1Uploaded byMahesh Waran
- FALLSEM2017-18_MEE1024_TH_SMV219_VL2017181007494_Reference(2).pptUploaded byRakib Khan
- Ram RecUploaded byEpic Win
- UMN EE 2301 Exam 1Uploaded bychris
- UntitledUploaded byoutdash2
- Matrix Partial FractionsUploaded bysanthosh kumar
- Algebra Calculus 2Uploaded byAahat Mon
- Problem Set 1Uploaded byBel

- Working Plan in Mathematics 9 for 1st Quarter.julioUploaded byJas Ten
- The Algebraic Approach II-VUploaded byRockBrentwood
- Quantitative MethodsUploaded byclaire
- A Course in Commutative Algebra - R. Ash (2003) WWUploaded byfunguyy
- 4 Bisection MethodUploaded byKen
- Algebra Skills for Level TwoUploaded bymgor2968
- Oleg Viro- Remarks on definition of Khovanov homologyUploaded byDuncan_Vim
- discretebook-fall2015 (1).pdfUploaded byFatima Sowar Eldahab
- Telangana 8th class Mathematics Text bookUploaded byRoshan Kumar
- Different i AbilityUploaded byThilak
- LinearUploaded byTapasRout
- Cadeias MarkovUploaded byFelipe Álvares
- Hw 4 SolutionUploaded byAhmad Jabbar
- An Introduction to Physically Based ModelingUploaded byrubao_poli
- Precalculus-Concepts-Through-Functions-A-Unit-Circle-Approach-to-Trigonometry-3rd-Edition-Sullivan-Solutions-Manual.pdfUploaded bya732815968
- Final Math FormulaUploaded byManish Kumar
- To Find the Last Digits of a Large PowerUploaded byPrabhanjan Mannari
- Mathematical Induction practiseUploaded byRizul thakur
- calculator solutionsUploaded byArturo Ramos Alvezo
- Improved DBSCAN for spatial databases with noise and different densitiesUploaded byahmed_fahim98
- Buku Teori Olimpiade Dan Latihan SoalUploaded bysudipriyambodo
- Numerical Method for engineers-chapter 15Uploaded byMrbudakbaek
- M3_Non Linear Data StructuresUploaded byresmi_ng
- I Can StatementsUploaded byDorothy Dwyer
- Finite Element Method for Maxwell’s EquationsUploaded byHFdzAl
- 2002 June MSUploaded byKaushal
- Math 321 NotesUploaded bynoahb110
- Lesson2-5DistributedMemorySorting.pdfUploaded byProjectlouis
- McGrawHill Functions 11 Unit 5Uploaded byblabdude123
- MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), Volume 3 / 2012Uploaded byAnonymous 0U9j6BLllB