LP_Graphic_Solution

LP_Graphic_Solution - Ple givea fe se ase w conds be thene...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Please give a few seconds before the next click for the animations to appear, thanks !
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem Statement Reddy Mikks produces both interior and exterior paints from two raw materials, M1 and M2. Basic data Tons of raw material per ton of Maximum daily Exterior paint Interior paint availability (tons) Raw material, M1 6 4 24 Raw material, M2 1 2 6 Profit per ton ($1000) 5 4 A market survey indicates that the daily demand for interior paint cannot exceed that of exterior paint by more than 1 ton. Also, the maximum daily demand of interior paint is 2 tons. Reddy wants to determine the optimum (best) product mix of interior and exterior paints that maximizes the total daily profit.
Background image of page 2
Equation Form Basic data Tons of raw material per ton of Maximum daily Exterior paint Interior paint availability (tons) Raw material, M1 6 4 24 Raw material, M2 1 2 6 Profit per ton ($1000) 5 4 *Decision variables : Need to determine the amounts to be produced of exterior and interior paints. x 1 = tons produced daily of exterior paint x 2 = tons produced daily of interior paint *Objective (goal) aims to optimize : The company wants to increase its profit as much as possible. z represents the total daily profit (in thousands of dollars) Maximize z = 5x 1 + 4x 2 *Constraints: Restrict raw materials usage and demand (Usage of a raw material) (Maximum raw material) by both paints availability 6x 1 + 4x 2 24 ( Raw material M1 ) x 1 + 2x 2 6 ( Raw material M2 ) -x + x 1 (Demand Limit)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Graphical Method Graph all constraints, including nonnegativity restrictions Solution space consists of infinity of feasible points Identify feasible corner points of the solution space Candidates for the optimum solution are given by a finite number of corner points Use the objective function to determine the optimum corner point from among all the candidates
Background image of page 4
Feasible Solution A feasible solution : any values of x 1 and x 2 that satisfy all the constraints of the model The complete Reddy Mikks model Maximize z = 5x 1 + 4x 2 subject to 3 1 3 1
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Graphical LP Solution Graphical procedure includes 2 steps Determination: 1) The solution space that defines all feasible solutions of the model 2) The optimum solution from among all the feasible points in the solution space Step 1: Determination of the Feasible Solution Space
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/15/2011 for the course CSCI 528 taught by Professor Rashid during the Spring '11 term at George Mason.

Page1 / 16

LP_Graphic_Solution - Ple givea fe se ase w conds be thene...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online