0 views

Uploaded by Cyna Lupera

Linear programming

- Linear Programming
- Weather Wax Bertsimas Solutions Manual
- Operations Research - An Introd - Hamdy a. Taha
- Decision Science - MCQ
- Operations Research
- fwebtechnology
- 521075.pdf
- Linear Programming
- KS Swarup_ Unit Commitment
- UT Dallas Syllabus for opre6302.001.10f taught by Kathryn Stecke (kes021000)
- Problem Formulation (LP Section1)
- linear programing notes
- OPERATIONAL RESEARCH ASSIGNMENT............(CA FINAL COST AND OR)
- 251399715-Sma-2343-Introd.pdf
- EA assignment
- lppmodule_2011
- Discret opimization and realworld problems
- ch02.ppt
- APP3.pdf
- Optimizing Reservoir Capacity, Water Allocation and Crop Yield using Teaching Learning Based Optimization (TLBO) Technique

You are on page 1of 5

The Wayside Pottery makes two types of clay pots. One is plain clay pot with reinforced rim.

The other is a smaller but fancier urn with handles and rope-like decoration on the sides.

Making the plain clay pot requires four pounds of clay and one hour of labor. It brings in a profit

of $4 per unit. The fancier urn is smaller, so it uses only three pounds of clay, but requires two

hours of labor. It brings in profits of $5 per unit. The firm employs one potter who works a 40

hours a week and is applied with 120 pounds of clay per week. How many plain pots and how

many urns should be made in order to maximize the company’s profit?

1. Define the variables

Let X = number of plain clay pots produced each day

Y = number of urns produced each day

2. Define the objective function

Maximize Z = 4X + 5Y

3. Define the constraints :

a) labor - X + 2Y ≤ 40

b) materials 4X + 3Y ≤ 120

5. Solving the two equations by eliminating one variable to find the value of

other variable.

(X + 2Y ≤ 40 ) 3 = 3X + 6Y = 120

(4X + 3Y ≤ 120) -2 = -8X - 6Y = -240

-5X + 0 = -120

-5X/-5 = -120/-

X = 24

To find Y X + 2Y = 40

24 + 2Y = 40

2Y = 40 - 24

2Y = 16

Y = 16/2

Y= 8

6. Using graph method calculate the profit for each feasible solution (4 region points/vertices)

and identify the one which give the highest profit.

Maximize Z = 4X + 5Y

= 0+0=0

= 0 + 5(20) = $100

= 4(24) + 5(8) = $96 + $40 = $136

= 4(30) + 0 = $120

All constraints relevant to a linear programming problem need to be defined in the form of

inequalities.

Step 2 Define the Objective Function

The objective of solving a problem is expressed in the form of a mathematical equation.

Step 3 Plot the constraints on a graph paper

Constraint inequalities, as defined in Step 1, should be plotted on a graph.

You may plot the constraints in the same manner as you would plot an equation.

Step 4 Highlight the feasible region on the graph

Once you have plotted the constraint inequalities on the graph, you need to shade the area of

the graph which is outside the constraint limits, i.e. which is not feasible.

Step 5 Plot the objective function on the graph

Objective Function line may be drawn on the graph in the same way as the constraint lines

except that you may choose to differentiate it from constraint lines, e.g. by drawing a dotted

line instead of the usual line.

Step 6 Find the optimum point

Optimum point of a linear programming problem always lies on one of the corner points of the

graph's feasible region.

Step 7 Find the coordinates of the optimum point

Exercises:

1. A farmer owns a 240 acres of land. If he will plant corn he could earn a profit of $40 per

acre and if oats will be planted he could earn a profit of $30 per hectare. Available number of

labor is 320 hours. For corn it requires 2 hours per acre, while for oats it requires 1 hour per

acre. How many acres will be planted for each product to maximize profit

Assumption: Let X represents number of acres for corn

while Y represents number of acres for oats

Objective: Maximize Profit Z = 40X + 30Y

Constraints: No. of acres (240), No. of hours available (320)

X + Y ≤ 240 2X + Y ≤ 320

Non-negativity X ≥ 0 Y ≥ 0 or X + Y ≥ 0

Profit Z = $40X + $30Y

Z= 0+0 =0

Z = 0 +240(30) = $7,200

Z = 80($40) + 160 ($30) = $3,200 +$4,800 = $8,000

Z = 160(40) + 0 = $6,400

Homework/Seatwork

3. The Riverside Furniture Co. makes two types of wooden rocking chairs. The big but simple

which spends 1 day labor and bring profits of P1,500 per chair. While the small special

rocking chair spends 2 days and brings profit P2,000 per chair. The firm employs one

carpenter who works a 24 days a month and is supplied with 1920 meters lumber per month.

The big and simple rocking chair uses 120 meters and 80 meters for small special per month .

Using linear programming, how many simple and special rocking chairs should be produced

per week in order to maximize the profits? Also complete the graph below by showing the

area of feasible solutions.

- Linear ProgrammingUploaded byMF Yousuf
- Weather Wax Bertsimas Solutions ManualUploaded bychencont
- Operations Research - An Introd - Hamdy a. TahaUploaded bymuhib
- Decision Science - MCQUploaded bypritesh
- Operations ResearchUploaded byKiran Datar
- fwebtechnologyUploaded bysharmila
- 521075.pdfUploaded byEsmael Adem
- Linear ProgrammingUploaded byMoid Aretaño Mesa
- KS Swarup_ Unit CommitmentUploaded byavishekkgec
- UT Dallas Syllabus for opre6302.001.10f taught by Kathryn Stecke (kes021000)Uploaded byUT Dallas Provost's Technology Group
- Problem Formulation (LP Section1)Uploaded bySwastik Mohapatra
- linear programing notesUploaded byPrerana Sachan
- OPERATIONAL RESEARCH ASSIGNMENT............(CA FINAL COST AND OR)Uploaded byPravinn_Mahajan
- 251399715-Sma-2343-Introd.pdfUploaded byIshmael Makhembu
- EA assignmentUploaded byLeeroy Lua
- lppmodule_2011Uploaded byBabitha Raghu
- Discret opimization and realworld problemsUploaded byAmit Gautam
- ch02.pptUploaded byBabar Ishaq
- APP3.pdfUploaded bysamsunglover
- Optimizing Reservoir Capacity, Water Allocation and Crop Yield using Teaching Learning Based Optimization (TLBO) TechniqueUploaded byGRD Journals
- A New Approach to Solve Type-2 Fuzzy Linear Programming Problem Using Possibility, Necessity, and Credibility MeasuresUploaded byAnonymous vQrJlEN
- Decision Models for ManagementUploaded byNikhil Boggarapu
- 174179_Lec02.pdfUploaded byalb3rtnet
- Slid 1Uploaded bynima1977
- 8 Chapter 3 Graphical MethodUploaded bydure
- IT3302p1-2007Uploaded byShubhayu Basu
- MAT133Y_TT2_2011F.pdfUploaded byexamkiller
- DRAFT10_051719.docxUploaded byCzarina Mae David
- OR BITSUploaded bySree Murthy
- Excel Solver ThiebookUploaded byMaria Cinda

- (Www.entrance-exam.net)-IIT JEE Maths Sample Paper 3Uploaded byMcRazy Eng
- ProcessUploaded byemadsafy
- Uploaded bylucyallyson
- Utopia BE TechUploaded bymchalkley
- Effects on Human SocietyUploaded byAubrey Songcog
- MK0018 International MarketingUploaded bysmu mba solved assignments
- OOP LecturesUploaded bycaspercastle
- U2100_L2100.xlsxUploaded byAhmad Yusrifar Junaid
- surveillance camera manualUploaded byenderoftime
- Technical Specifications Wilbur PM2.5Uploaded byOscar
- Week 10Uploaded byRoslaini Zali
- EPBMUploaded bySandip Sarkar
- UntitledUploaded byapi-233604231
- Chapter 2Uploaded byChelsea Anne Vidallo
- T101 Drilling Machine BrochureUploaded byRicardo Ortega
- Chat X DocumentationUploaded byTR
- Quiz 2Uploaded bymurali_bharadwaz
- Northumbria universityUploaded byRunaway Shuji
- pado (1).pdfUploaded byCrisanto R. Oroceo
- Beyond Lean Operational Excelence in MroUploaded bySkyales
- TDR impedance measurementUploaded byjofinjv3194
- RawTherapee4UserManual EnglishUploaded byHal.9000
- Article 5 Pepita TorbrandUploaded byAsuran
- Walmart Discrimination CaseUploaded bypemnad
- Dlink Dap 1160Uploaded byarkatsik
- OJT Activity PlanUploaded byAnonymous AgfXgyLX
- Final Exam Study Guide - MarketingUploaded byNicole McCoy Wilson
- 18_ftp.pdfUploaded byAnonymous hzPLHR
- Newsademic Issue 209 bUploaded byLana Nguyen
- micro teach lesson planUploaded byapi-333221520