1 / 11

A Prototype Example: The Galaxy Linear Programming Model

A Prototype Example: The Galaxy Linear Programming Model. Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2 £ 1000 (Plastic) 3X 1 + 4X 2 £ 2400 (Production Time) X 1 + X 2 £ 700 (Total production) X 1 - X 2 £ 350 (Mix)

keefe-brady
Download Presentation

A Prototype Example: The Galaxy Linear Programming Model

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Prototype Example: The Galaxy Linear Programming Model Max 8X1 + 5X2 (Weekly profit) subject to 2X1 + 1X2£ 1000 (Plastic) 3X1 + 4X2£ 2400 (Production Time) X1 + X2£ 700 (Total production) X1 - X2£ 350 (Mix) Xj> = 0, j = 1,2 (Nonnegativity)

  2. The Graphical Analysis of Linear Programming The set of all points that satisfy all the constraints of the model is called a FEASIBLE REGION

  3. Using a graphical presentation we can represent all the constraints, the objective function, and the three types of feasible points.

  4. Graphical Analysis – the Feasible Region The non-negativity constraints X2 X1

  5. The Plastic constraint 2X1+X2 = 1000 Graphical Analysis – the Feasible Region X2 1000 700 Total production constraint: X1+X2 =700 (redundant) 500 Infeasible Feasible Production Time 3X1+4X2 = 2400 X1 500 700

  6. Graphical Analysis – the Feasible Region X2 The Plastic constraint 2X1+X2 = 1000 1000 700 Total production constraint: X1+X2 = 700 (redundant) 500 Infeasible Production mix constraint: X1-X2 =350 Feasible Production Time 3X1+4X2= 2400 X1 500 700 • Boundary points. Extreme points. • Interior points. • There are three types of feasible points

  7. Solving Graphically for an Optimal Solution

  8. The search for an optimal solution Start at some arbitrary profit, say profit = $2,000... X2 Then increase the profit, if possible... 1000 ...and continue until it becomes infeasible 700 Profit =$4360 500 X1 500

  9. Summary of the optimal solution Space Rays = 320 dozen Zappers = 360 dozen Profit = $4360 • This solution utilizes all the plastic and all the production hours. • Total production is only 680 (not 700). • Space Rays production exceeds Zappers production by only 40 dozens.

  10. Main Result: Extreme points and optimal solutions • If a linear programming problem has an optimal solution, an extreme point is optimal.

  11. Computer Solution of Linear Programs With Any Number of Decision Variables • Linear programming software packages solve large linear models i.e. many decision variables and many constraints. • Graphical method is limited to 2-decision variable LP problems, however, LP software packages use the Main Result of graphical method, called the Simplex algorithm. • The input to any package includes: • The objective function criterion (Max or Min). • The type of each constraint: . • The actual coefficients for the problem.

More Related