Attribution Non-Commercial (BY-NC)

12 views

Attribution Non-Commercial (BY-NC)

- lecture Notes 20150101
- hw01p0073n01_jmk
- Chapter 2
- SEN301
- Lp Notes
- Linear Programming
- Lingo Users Manual
- Chap 7
- THE APPLICATION OF MANAGEMENT SCIENCE IN DECISION MAKING AND FORECASTING IN MANUFACTURING COMPANIES (PZ CUSSONS AS CASE STUDY)
- BA503
- Operations Research_Class1 to Class 3
- cplex
- Chapter 0 - Introduction to CENG 6103
- Li, Chang - Computational Methods for American Put Options
- Chapter 10
- cplex.pdf
- OPERATIONS RESEARCH (Report).pptx
- Aggregate Planning
- Linear and Nonlinear Programming With Maple an Interactive, Applications-based Approach
- Linear Programming

You are on page 1of 12

Lecture 3

Outline

:

Lecture 2 review: LP Formulation Lecture 3: Graphical Solution (2D case)

Lecture 3

A company makes two types of paint: exterior and interior. A prot (per ton) $5000 and $4000 for exterior and interior paint, respectively To produce the paint, two raw materials have to be used, as follows: Material M1: 6 tons per ton of exterior paint and 4 tons per ton of interior paint Material M2: 1 ton per ton of exterior paint and 2 tons per ton of interior paint The daily availability of the raw materials M1 and M2 is limited to 24 and 6 tons, respectively Problem: The company wants to determine the best production plan (the plan that maximizes the daily prot)

Operations Research Methods 2

Lecture 3

Decision variables: x1, x2 amount of exterior/interior paint produced daily (tons) Objective: maximize prot 5x1 + 4x2 (in thousand of dollars) Constraints: 6x1 + 4x2 24, x1 + 2x2 6 - raw material M1/M2 resources

LP Formulation: maximize subject to

Operations Research Methods 3

Lecture 3

The objective is a linear function: z = a1x1 + + anxn, ai are given scalars (specic data). Each constraint is a linear (ane) inequality or equality: c 1 x1 + + c n xn b c 1 x1 + + c n xn b c 1 x1 + + c n xn = b

Lecture 3

Examples

minimize z = 4x1 + 5x2 subject to 3x1 + 2x2 2 2x1 x2 0 x1 and x2 are integers, i.e., x1, x2 {0, 1, 2, }

Lecture 3

Graphical Solution

1. 2. 3. Draw the constraints. Draw the isocost lines of the objective Determine optimal point(s) going in the direction of the gradient of the objective if maximizing (negative gradient if minimizing)

Lecture 3

maximize z = 5x1 + 4x2 subject to 6x1 + 4x2 24 x1 + 2x2 6 x1 , x 2 0

Lecture 3

Lecture 3

The constraint set is a polyhedral set (intersection of nitely many half-spaces) The intersection of any of two lines (corresponding to two dierent constraints) denes a corner or a vertex In our example, the vertices are A = (0, 0), B = (0, 3), C = (3, 1.5), D = (4, 0), (0, 6), and (6, 0) Some vertices are feasible for the problem, and some are not. In our example, A, B, C, and D are feasible (belong to the constraint set), while (0, 6), and (6, 0) are not feasible (lie outside of the constraint set)

Lecture 3

Reddy Mikks: Objective & Optimal Solution Objective z = 5x1 + 4x2 to be maximized

10

Lecture 3

We can solve graphically problems with 2 decision variables In general, when the number of decision variables is larger than 2, we can use simplex method. The vertices play important role in this case Please check the course web for Homework 1. It is posted, and it is due next Friday, Sep. 4 Also, all GE students, please check the announcement for the enrollment in GE397 to get the correct course credit.

11

- lecture Notes 20150101Uploaded byBiljana Vujovic
- hw01p0073n01_jmkUploaded byInho Woo
- Chapter 2Uploaded byAthir03
- SEN301Uploaded byshyrazkhan
- Lp NotesUploaded bySumit Verma
- Linear ProgrammingUploaded bySamuel Bruce Rockson
- Lingo Users ManualUploaded byMiziphi Ppm
- Chap 7Uploaded byCh V S Raju
- THE APPLICATION OF MANAGEMENT SCIENCE IN DECISION MAKING AND FORECASTING IN MANUFACTURING COMPANIES (PZ CUSSONS AS CASE STUDY)Uploaded byijsret
- BA503Uploaded bySyed Talha Kamal
- Operations Research_Class1 to Class 3Uploaded byPriyesh Wankhede
- cplexUploaded byAbhishek Puri
- Chapter 0 - Introduction to CENG 6103Uploaded bySeble Getachew
- Li, Chang - Computational Methods for American Put OptionsUploaded byEdwin Hauwert
- Chapter 10Uploaded byshinjikenny
- cplex.pdfUploaded byIvan Bancev
- OPERATIONS RESEARCH (Report).pptxUploaded bytenmachan021
- Aggregate PlanningUploaded byEshwar Devaramane
- Linear and Nonlinear Programming With Maple an Interactive, Applications-based ApproachUploaded byMohammad Abdelaal
- Linear ProgrammingUploaded byDeepjyoti Roy
- Linear ProgrammingUploaded byvsuarezf2732
- THE EFFICIENT MODELLING OF STEAM UTILITY SYSTEMS.pdfUploaded byvazzoleralex6884
- Detailed TOCUploaded byUlriksen
- Vjezbe2Uploaded byEsmer Shokata Hadzibegić
- OR2_INTEGER_PROGRAMMING_MODEL.docxUploaded byLiraEspirituoso
- MIT15_053S13_lec11.pdfUploaded byShashank Singla
- Industrial EngineeringUploaded byDeepam Sharma
- Linear%20Programming-1 (1).pptUploaded byCarlos Williamson
- Operation Research Sir Haidar AliUploaded byUmar Jutt
- Linear Programming Quantitative TechniquesUploaded byJomabele

- DefinitionsUploaded byUZMA SIDDIQUE
- T1Uploaded byUZMA SIDDIQUE
- ch10_supUploaded byUZMA SIDDIQUE
- Application Form for EpeUploaded byUZMA SIDDIQUE
- Self DeciplineUploaded byUZMA SIDDIQUE
- Diagnosing & Changing Organizational CultureUploaded byadriana_enriquez
- 03 Chapter 2Uploaded byUZMA SIDDIQUE
- Supporting ChangeUploaded byUZMA SIDDIQUE

- maze problem in Artificial intelligence.Uploaded byMohammed Faizul Gani
- New Microsoft Office Word DocumentUploaded byNavneet Kaur
- CS502 Fundamentals of Algorithms 2013 Final Term Questions Answers Solved With References by MoaazUploaded byShahrukh Usman
- Algorithms for Query Processing and OptimizationUploaded byakashdeepime
- Wff Tautologies 2Uploaded byJOhn Dadang
- Matching2016 B Halls TheoremUploaded byAniket More
- What is OperatorUploaded byMonzieAir
- DsaUploaded byTiễn Dương
- Oultine CS 729 Theory of Automata and Formal Languages Spring 2011(MCS 2 Morning)Uploaded byTaqi Shah
- TOC QuestionsUploaded byjyothimidhuna
- TCS_CFG_L1Uploaded byHitarth Dadhania
- Data CompressionUploaded bySurenderMalan
- List of Deep Learning and NLP ResourcesUploaded byBartoszSowul
- 1. Recursion Homework 1Uploaded byStefan Petrov
- Mendelson- On Some Recent Criticism of Church's Thesis.notre Dame Journal of Formal Logic Volume 4 Issue 3 1963 [Doi 10.1305%2Fndjfl%2F1093957577]Uploaded bylosolores
- AlgoBook Cormen DijkstraUploaded byDeez Nuts
- Module 1 Topic 2Uploaded byRaheem
- Knowledge representation techniqueUploaded byDhiraj Kapila
- Stochastic Gradient DescentUploaded bypenets
- skillset.xlsUploaded byTavishi Singh
- GraphsUploaded byAjit More
- Newton Raphson Method - NUMERICAL METHODSUploaded byKen
- Paper - Practical Guidelines for Solving Difficult MIPUploaded bySafi Rehman
- Econ5725 NonLinear EquationsUploaded byApel_Apel_King
- Fft Using VhdlUploaded byMad Hatter Mercury
- Algoritm BackTracking EnglezaUploaded byionutz_67
- Decomposition TechniquesUploaded byHarkamal Singh
- Dynamic ProgrammingUploaded byryufernanda
- 09,10 - Facility location models for distribution system designUploaded byPedro Braga
- Greedy TechniqueUploaded bygorakhnnath

## Much more than documents.

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

Cancel anytime.