Scribd
Upload
17 views

L6.Linear Programming Models

The document discusses linear programming models and how to formulate them. It explains that linear programming techniques can be used to obtain optimal solutions to problems with constraints like materials, budgets, labor or machine time. It provides steps for formulating a linear programming model, including defining the objective, decision variables, constraints and coefficients. An example is given to maximize profit subject to assembly, inspection and storage constraints.

Uploaded by

Tharaka Pathirana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

L6.Linear Programming Models

The document discusses linear programming models and how to formulate them. It explains that linear programming techniques can be used to obtain optimal solutions to problems with constraints like materials, budgets, labor or machine time. It provides steps for formulating a linear programming model, including defining the objective, decision variables, constraints and coefficients. An example is given to maximize profit subject to assembly, inspection and storage constraints.

Uploaded by

Tharaka Pathirana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

ME 6304

Production Planning and Control

Eng. Ravindu Lokuliyana


L6: Linear Programming DMME,
Faculty of Engineering,
Models University of Ruhuna.
Linear Programming
• Linear programming (LP) techniques
consist of a sequence of steps that will
lead to an optimal solution to problems, in
cases where an optimum exists.

• Used to obtain optimal solutions to problems that involve


restrictions or limitations, such as:
– Materials
– Budgets
– Labor
– Machine time
Linear Programming Assumptions

• Linearity: the impact of decision variables is


linear in constraints and objective function
• Divisibility: non-integer values of decision
variables are acceptable
• Certainty: values of parameters are known
and constant
• Non-negativity: negative values of decision
variables are unacceptable
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the
Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS
of Constraint
• Write Coefficient for each decision variable in each
Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Formulating Linear Programming
• Define the Objective
• Define the Decision Variable
• Write the mathematical Function for the Objective
• Write one or two word description for each
constraint
• RHS for each constraint, including unit measure
• Write = , ≤, or ≥ for each constraint
• Write in all of the decision variables on the LHS of
Constraint
• Write Coefficient for each decision variable in
each Constraint
Linear Programming Example

• Objective - profit
Maximize Z =60X1 + 50X2
• Subject to
4X1 + 10X2 ≤ 100 hours Assembly
2X1 + 1X2 ≤ 22 hours Inspection
3X1 + 3X2 ≤ 39 cubic feet Storage
X1, X2 ≥ 0
Example
Example

You might also like