How What’sBest! diagnoses solution issues

Slides:



Advertisements
Similar presentations
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Advertisements

Branch and Bound See Beale paper. Example: Maximize z=x1+x2 x2 x1.
and Models Without Unique Optimal Solutions
Ch 3 Introduction to Linear Programming By Kanchala Sudtachat.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
9.4 – Solving Absolute Value Equations and Inequalities 1.
Chapter 3 An Introduction to Linear Programming
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Systems of Linear Inequalities.  Two or more linear inequalities together form a system of linear inequalities.
Graphical Solutions Plot all constraints including nonnegativity ones
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
C&O 355 Lecture 2 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
L4 Graphical Solution Homework See new Revised Schedule Review Graphical Solution Process Special conditions Summary 1 Read for W for.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Linear Optimization Lecture 1: Introduction Instructor: Tsvetan Asamov.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
D Nagesh Kumar, IIScOptimization Methods: M3L2 1 Linear Programming Graphical method.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1 n X n
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
1.7 Linear Inequalities.  With an inequality, you are finding all values of x for which the inequality is true.  Such values are solutions and are said.
1. 2 We studying these special cases to: 1- Present a theoretical explanation of these situations. 2- Provide a practical interpretation of what these.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
The Quadratic Formula & Discriminant
Decision Support Systems
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Special Cases in simplex method applications
Linear Programming Topics General optimization model
Managerial Economics Linear Programming
2.6 Solving Absolute-Value Inequalities
Section 1-6 Solving Inequalities.
6-7 Graphing and Solving Quadratic Inequalities
Solving Inequalities Using Addition and Subtraction
Consider corner pt. feasible A, B, C, D, E, F A: (0,0), Z = 0
Graphical Analysis – the Feasible Region
Linear Programming Topics General optimization model
Systems of Equations/Inequalities
Linear Programming Topics General optimization model
The ABC’s of Optimization
3.2 Linear Programming 3 Credits AS
How LINGO diagnoses solution issues
Linear Programming Topics General optimization model
The ABC’s of Optimization
3-3 Optimization with Linear Programming
Linear Programming.
3-2 Solving Inequalities Using Addition or Subtraction
Introduction to Optimization and Linear Programming (LP)
8.4 Linear Programming p
Chapter 4: Solving Inequalities
Integer Programming with What’sBest
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Integer Programming with LINGO
A more complex LP problem
A more complex LP problem with What’sBest!
Indicator 10 Solving Inequalities.
POWER CHALLENGES Several Ways To Solve 7 CHALLENGES.
Exercise Solve for x, telling what property was used to solve the equation. x − 3 = 7 x = 10; Addition Property of Equality.
A more complex LP problem
Integer Programming with What’sBest
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Give the solution to each inequality.
Linear Constrained Optimization
Presentation transcript:

How What’sBest! diagnoses solution issues LSW3-1 How What’sBest! diagnoses solution issues LINDO Systems www.lindo.com

When we try to solve a problem, Possible Outcomes: Infeasible Feasible Optimization Problems in General, Solution Issues LSW3-2 When we try to solve a problem, Possible Outcomes:   Infeasible Feasible Optimum(Finite) Unbounded

LSW3-3 Formulations with Anomalies   1) Unbounded, Clearly a mistake.     2) Infeasible, Could be a mistake, but could be a misunderstanding of what is simultaneously possible.     3)  Multiple or Alternative Optima Quite common, but not good. God’s way of telling us to put more detail into the objective function. Real people are not indifferent between alternatives.

Example #1: Unique Solution LSW3-4 Unique, bounded objective function value z*=104 Nonempty, bounded feasible region 4

What’sBest! Model LSW3-5

Example #2: Unique Solution LSW3-6 Unique, bounded objective function value z*=5.33 Nonempty, unbounded feasible region 6

What’sBest! Model LSW3-7

Example #3: No Solutions: Infeasible LSW3-8 First two inequalities are inconsistentempty feasible region z* does not exist 8

What’sBest! Model LSW3-9 max=x1; x1+x2<=2; 2*x1+2*x2>=8;

Example #4: No Solution: Unbound LSW3-10 Unbounded objective function value Unbounded feasible region Note: unbounded objective function value unbounded feasible region, but the reverse is not true (see the next example) 10

What’sBest! Model LSW3-11 max = -x1+x2; x1<=2;

Example #5: Infinite # of Solutions LSW3-12 Infinite # of solutions along the edge between x1 and x2 Nonempty, bounded feasible region 12

What’sBest! Model LSW3-13

What’sBest! Model LSW3-13

What’sBest! Model LSW3-13

Thank you for your attention. For more information, please visit www.m-focus.co.th or Call 02-513-9892