w.b taylor

© All Rights Reserved

49 views

w.b taylor

© All Rights Reserved

- Optimun Task Scheduling Heuristic for Banking System
- OPTIMIZATION OF FRAMES WITH SEMI RIGIDS CONNECTIONS 1995.pdf
- Study on Simplex Method and Design & Development of Application for Solving Simplex Problem using Python
- Solver Excel User.pdf
- linear
- Figura AG Super
- A Farm Resource Allocation Problem a Case Study of Model a Resettled Farmers in Bindura Zimbabwe 2162 6359-2-142
- Sensitivity_analysis
- Application of Heuristic Algorithms to Optimal PMU Placement in Electric Power Systems an Updated Review
- A design procedure for a supervisory control structure in plantwide control_Marcela_Moscoso_2014.pdf
- Sornette Optimal Thermal Causal Path
- Productivity Analysis and Improvements
- 9 Momentum Principle Tutorial Solution
- Chapter 26 Reliability Analysis of Tubular Joints in Offshore Structures
- Model I Set II ME CSE
- Vip Tutorial
- Notes
- Kuwata Thesis
- geom.pdf
- Linear Programming i

You are on page 1of 6

PROBLEM SUMMARY

35.

1.

Maximization

36.

2.

Maximization

37.

3.

Minimization

38.

4.

39.

5.

Minimization

40.

6.

Maximization

41.

7.

42.

8.

43.

9.

44.

10.

45.

11.

46.

12.

47.

13.

48.

14.

49.

*15.

50.

51.

Infeasible problem

52.

Unbounded problem

16.

*17.

18.

19.

Standard form

20.

21.

Standard form

22.

PROBLEM SOLUTIONS

1.

x2

A: x1 = 0

x2 = 3

Z=6

12

10

23.

24.

25.

26.

27.

B: x1 = 15/7

x2 = 16/7

Z = 152/7

8

6

*C: x1 = 5

x2 = 0

Z = 40

Point C is optimal

Z

0

28.

29.

30.

31.

32.

33.

34.

C

2

10

12

subject to

10x1 + 10x2 100 (line 1, hr)

7x1 + 3x2 42 (line 2, hr)

x1,x2 0

14

x1

Wood

Sugar

2x1 + 6x2 36 lb

2(6) + 6(3.2) 36

12 + 19.2 36

31.2 36

36 31.2 = 4.8

2x1 + 4x2 16

2(0) + 4(4) 16

16 16

There is no sugar left unused.

8.

11.

x2

*A : x1 = 0

x2 = 9

Z = 54

12

is parallel to the constraint for labor, which

results in multiple optimal solutions. Points B

(x1 = 30/7, x2 = 32/7) and C (x1 = 6, x2 = 3.2)

are the alternate optimal solutions, each with a

profit of $4,000.

10 A

B : x1 = 4

x2 = 3

Z = 30

6

B

C : x1 = 4

x2 = 1

Z = 18

Point A is optimal

subject to

2x1 + 4x2 16 (sugar, lb)

x1 5 (demand for cakes)

x1,x2 0

10

6

A

4

2

0

10

8

x2 = 0

Z=5

10

12

14

Point B is optimal

C

0

substitute the optimal solution into the resource

constraints for flour and sugar and determine

how much of each resource is left over.

C : x1 = 3

x2 = 1

Z = 290

D : x1 = 6

x2 = 0

Z = 480

x1

10.

x1

12

10

Point A is optimal

A : x1 = 0

x2 = 6

Z = 300

* B : x1 = 1

x2 = 3

Z = 230

12

C : x1 = 5

B

x2

(b)

B : x1 = 2

x2 = 3

Z = 17

x1 + x2 4 (antibiotic 2, units)

2x1 + 6x2 12 (antibiotic 3, units)

x1,x2 0

*A : x1 = 0

x2 = 4

Z = 20

12

subject to

(b)

x2

10

12

14

subject to

Flour

2x1 + 4x2 20 (platinum, oz)

x2 4 (demand, bracelets)

x1,x2 0

5x1 + 5x2 25 lb

5(0) + 5(4) 25

20 25

25 20 = 5

There are 5 lb of flour left unused.

x1

and C'.

A:

x1 = 0

x2 = 30

Z = 1,200

*B':

x1 = 15.8

x2 = 20.5

Z = 1,610

C':

subject to:

3x1 + 5x2 + s1 = 50

2x1 + 4x2 + s2 = 40

x1 + s3 = 8

x1, x2 0

A: s1 = 0, s2 = 0, s3 = 8, s4 = 0

B: s1 = 0, s2 = 3.2, s3 = 0, s4 = 4.8

C: s1 = 26, s2 = 24, s3 = 0, s4 = 10

x1 = 24

x2 = 0

Z = 1,200

22.

x2

A : x1 = 8

x2 = 6

Z = 112

16

18.

x2

12

10

8

6

B

Z

14

* B : x1 = 4

10

x2 = 1

Z=7

10

12

14

23.

x1 + s2 = 4

x2 + s2 = 6

x1 + x2 + s3 = 5

x1, x2 0

20.

x2

A : x1 = 0

x2 = 10

Z = 80

12

A

* B : x1 = 8

8

x2 = 5.2

Z = 81.6

Point B is optimal

C : x1 = 8

x2 = 0

Z = 40

B

Z

2

C

0

x1

10

10

12

14

16

18

12

14

16

18

20

x1

20

(x1 = 8, x2 = 6, Z = 112), and the constraint,

x1 + x2 15, is no longer part of the solution

space boundary.

subject to

16x1 + 12x2 450 (claims)

x1 + x2 40 (workstations)

0.5x1 + 1.4x2 25 (defective claims)

x1, x2 0

A: s1 = 4, s2 = 1, s3 = 0

B: s1 = 0, s2 = 5, s3 = 0

C: s1 = 0, s2 = 6, s3 = 1

C : x1 = 15

x2 = 0

Z = 97.5

Point B is optimal

x1

subject to:

A

Z

10

*B : x1 = 10

x2 = 5

Z = 115

12

C : x1 = 4

x2 = 0

Z=6

Point B is optimal

4

2

A : x1 = 0

x2 = 5

Z=5

21.(b)

29.

x2

A : x1 = 2.67

x2 = 2.33

Z = 22

12

x2

50

10

45

A : x1 = 28.125

x2 = 0

Z = 1,800

40

*B : x1 = 20.121

x2 = 10.670

Z = 1,735.97

35

30

C : xx11 == 34.45

5.55

xx22 = 5.55

34.45

Z = 2,437.9

D : x1 = 40

x2 = 0

Z = 2,560

B : x1 = 4

x2 = 3

Z = 30

*C : x1 = 4

x2 = 1

Z = 18

4

B

A

2 Z

Point C is optimal

C

25

Point B is optimal

10

12

x1

20

15

30.

10

B

C

31.

A

0

10

15

20

25

30

35

D

40 45

50

x2

A : x1 = 4.8

12

x1

x2 = 2.4

Z = 26.4

10

*B : x1 = 6

25.

26.

processor from $64 to $54 will change the

solution to point A in the graphical solution

where x1 = 28.125 and x2 = 0, i.e., there will be

no part-time operators. Changing the pay for a

part-time operator from $42 to $36 has no

effect on the number of full-time and part-time

operators hired, although the total cost will be

reduced to $1,671.95

x2 = 1.5

Z = 31.5

6

4

A

Point B is optimal

Feasible

space

B

x1

10

12

14

x2

32.

would result in a new solution, x1 = 0 and x2 =

37.5, where only part-time operators would be

hired.

A : x1 = 4

12

x2 = 3.5

Z = 19

10

*B : x1 = 5

27.

enough workstations to handle the increase in

the volume of claims.

x2 = 3

Z = 21

C : x1 = 4

x2 = 1

Z = 14

B

2

28.

x2

12

Point B is optimal

10

2

4

C

6

10

12

6

8

C : x1 = 6

x2 = 0

Z = 48

x2 = 2

Z = 44

10

* B : x1 = 4

A : x1 = 2

x2 = 6

Z = 52

x1

10

10

Point B is optimal

12

x1

49.

fertilizer constraint changes to 20x1 + 20x2

800 tons. The new solution space is A'B'C'D'.

Two of the constraints now have no effect.

x1

1.5

x2

The solution is, x1 = 160, x2 = 106.67, Z = $568

x2

120

500

100

X2

450

80

*A: X1=106.67

A: X2=160

A: Z=568

400

350

B: X1=240

*A: X2=0

*A: Z=540

60

B

40

A

20

Point A is optional

300

250

200

20 D 40

60

80

x1

150

A

100

50

A':

x1 = 0

x2 = 37

Z = 11,100

*C':

x1 = 26

x2 = 14

Z = 14,600

B':

x1 = 3

x2 = 37

Z = 12,300

D':

x1 = 26

x2 = 0

Z = 10,400

B

0

50

100

150

200

250

300

350

400

450

500

X1

subject to

x1 + x2 50 (available land, acres)

10x1 + 3x2 300 (labor, hr)

8x1 + 20x2 800 (fertilizer, tons)

x1 26 (shipping space, acres)

x2 37 (shipping space, acres)

x1,x2 0

50.

x2

C : x1 = 33.33

A : x1 = 0

x2 = 6.67

x2 = 60

Z = 106,669

Z = 60,000

80

70

60

B : x1 = 10

D : x1 = 60

x2 = 30

x2 = 0

Z = 60,000

Z = 180,000

50

(b)

x2

120

100

80

60

40

A B

CD

20

E

F

0

20

* D : x1 = 21.4

A : x1 = 0

x2 = 28.6

x2 = 37

Z = 17,140

Z = 11,100

40

B : x1 = 7.5

E : x1 = 26

x2 = 37

x2 = 13.3

Z = 14,100

Z = 14,390

20

30

B

Multiple optimal solutions; A

and B alternate optimal.

10

C : x1 = 16.7

F : x1 = 26

x2 = 33.3

x2 = 0

Z = 16,680

Z = 10,400

C

D

0

10

20

30

40

50

60

70

80

x1

Point D is optimal

40

60

80

x1

14

51.

x2

80

Infeasible Problem

70

60

50

40

30

3

A

2

20

Optimal point

10

0

0

10

20

52.

30

40

50

60

70

80

x1

Z = 0.05. This means that a patrol sector is 1.5

miles by 1 mile and the response time is 0.05

hr, or 3 min.

x2

80

70

CASE SOLUTION:

THE POSSIBILITY RESTAURANT

Unbounded Problem

60

50

40

subject to

30

x1 + x2 60

.25x1 + .50x2 20

x1/x2 3/2 or 2x1 3x2 0

x2/(x1 + x2) .10 or .90x2 .10x1 0

x1,x2 0

20

10

x1

20

10

10

20

30

40

50

60

70

80

x2

CASE SOLUTION:

METROPOLITAN POLICE PATROL

A : x1 = 34.3

100

x2 = 22.8

Z = $776.23

80

problem is

minimize Z = x/60 + y/45

subject to

2x + 2y 5

2x + 2y 12

y 1.5x

x,y 0

The objective function coefficients are

determined by dividing the distance traveled,

ie., x/3, by the travel speed, ie., 20 mph. Thus,

the x coefficient is x/3 20, or x/60. In the first

two constraints, 2x + 2y represents the formula

for the perimeter of a rectangle.

B : x1 = 40

70

x2 = 20

Z = $800

optimal

60

x1 + x2 60

2 x1 3 x2 0

50

C : x1 = 6

x2 = 54

Z = $744

40

30

Optimal point

A

20

.90 x2 .10 x1 0

10

0

15

.25 x1 + .50 x2 20

C

10

20

30

40

50

60

70

80

100

x1

- Optimun Task Scheduling Heuristic for Banking SystemUploaded byAnesu Mushate
- OPTIMIZATION OF FRAMES WITH SEMI RIGIDS CONNECTIONS 1995.pdfUploaded byhiginio.moro6182
- Study on Simplex Method and Design & Development of Application for Solving Simplex Problem using PythonUploaded byAnonymous izrFWiQ
- Solver Excel User.pdfUploaded byraeti2013
- linearUploaded bySelva Subramaniam Ramiah
- Figura AG SuperUploaded byBogdan Neagu
- A Farm Resource Allocation Problem a Case Study of Model a Resettled Farmers in Bindura Zimbabwe 2162 6359-2-142Uploaded byHadiBies
- Sensitivity_analysisUploaded byMarek
- Application of Heuristic Algorithms to Optimal PMU Placement in Electric Power Systems an Updated ReviewUploaded bywvargas926
- A design procedure for a supervisory control structure in plantwide control_Marcela_Moscoso_2014.pdfUploaded byAndrés Ceverisae
- Sornette Optimal Thermal Causal PathUploaded byAnatoly Voroshilov
- Productivity Analysis and ImprovementsUploaded byAsh Pasquil
- 9 Momentum Principle Tutorial SolutionUploaded byAniket Babuta
- Chapter 26 Reliability Analysis of Tubular Joints in Offshore StructuresUploaded byMARIA
- Model I Set II ME CSEUploaded byشايك يوسف
- Vip TutorialUploaded byHipolito Losada
- NotesUploaded bynataliepoison8917
- Kuwata ThesisUploaded bymykingboody2156
- geom.pdfUploaded bydmp130
- Linear Programming iUploaded byAlain Bernabe
- 1-s2.0-S0098135499800404-mainUploaded byCalcetin
- Operation Research AssignmentUploaded bydebanik13498
- mech02.pdfUploaded byMiroslav Zivkovic
- Quantitative TechniquesUploaded byPrateek Dave
- Hetro-peak minimization-2016.pdfUploaded byHasan L. Khan
- 10.1.1.119Uploaded byNITSU009
- 14-2010-Differential Evolutionary Algorithms in Optimal Distributed Generation LocationUploaded byAbbas Divian
- 1-Introduction-dan-Network-I.pdfUploaded bykhamaludin
- Administracion de La Cadena de SuministroUploaded byMaricela Villegas
- MBE2036-8Uploaded byWylie

- Models of Policy Analysis.pptUploaded byAkmal Gondal
- IKEAUploaded byAkmal Gondal
- Bauer and Ryser, 2004Uploaded byAkmal Gondal
- MsiaGrowthExperience Dr -Ariff (1)Uploaded byAkmal Gondal
- Sieg Mann 2009Uploaded byAkmal Gondal
- 2013 Human Resource Development . MPA. IV semester.pdfUploaded byAkmal Gondal
- malaysianairlinespowerpoint-140522134536-phpapp01Uploaded byAkmal Gondal
- PAM lec 9Uploaded byAkmal Gondal
- guzette.pdfUploaded byAkmal Gondal
- NHA-Act-2001.pdfUploaded byAkmal Gondal
- Public Administartion Theory and Seperation of Powers- David H. RoosenbloomUploaded byAkmal Gondal
- Unilever Pakistan Sustainability Report 2012_tcm96-355078Uploaded byAkmal Gondal

- State Transition Diagram to PLC Ladder Logic Translation WhitepaperUploaded bymhrahb
- Blue Coat Authentication Webcast FinalUploaded byridd
- Linux Hardening in Hostile Networks Server Security From TLS to Tor (Pearson Open Source Software Development Series)_Technet24Uploaded bymidou men
- I2 Server GuidelinesUploaded byPerpessicius
- LED_EditUploaded bydfrhjgbeirguehbir
- AdcUploaded byCésar Tapia
- Low Power Efficient Dadda MultiplierUploaded byDwarakaManeekantaAddagiri
- PurVIEW BrochureUploaded bylayachi
- MCCMG161Uploaded bypravin1350
- AUTOSAR Specification of CAN Driver Ver 4.0.0.pdfUploaded byJoshwa2el
- Intel 8051 Instruction SetUploaded byRakesh Gangwar
- Week 7 - Exact Solving TechniquesUploaded byEmile Cornelissen
- 2018_Endpoint_Security_Report_ENSILO .pdfUploaded byLukas
- Powersc PDFUploaded byMauricio Locatelli
- T315-16 Alarm and Events - RevAUploaded byLimJohnvyn
- A 29002Uploaded byvetchboy
- Hp Man DP7.00 EncodingCompress Wp PDFUploaded byusufin
- Cs 246 Listing Xrc ModuleUploaded bymartinimartiini
- A Novel Fragile Watermarking Scheme For Image Tamper Detection Using K Mean ClusteringUploaded byseventhsensegroup
- embedding graphics in ESL drawing.PDFUploaded byanoop2010
- #15 Application of PointersUploaded byPinky Bhagwat
- BO Universe Performance-tuningUploaded byAndrew Yeung
- VMware Interview QuestionsUploaded bypry_kum
- MRAMUploaded bynea29
- Ec2306 Digital Signal Processing Lab Manual for TMS320C6745Uploaded byPartho Rana
- Lemp Server on Ubuntu 16 04Uploaded bymanaf hasibuan
- Oracle 9i Data Warehousing GuideUploaded byapi-25919427
- Top 50 SQL Question & AnswersUploaded byanupam20099
- Java Java Notes 4Uploaded byapi-26972476
- Software Requirements LibroUploaded byJosé Luis Neme Pereda