Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
266 views

10a-Linear Programming

Here is the linear programming model for this problem: Let: X1 = Number of shirts produced X2 = Number of pajamas produced Maximize: Z = 4X1 + 3X2 Subject to: Cutting: 1.5X1 + 2X2 ≤ 450 Sewing: X1 + 0.75X2 ≤ 280 Non-negativity: X1, X2 ≥ 0 The objective is to maximize total profit contribution by determining the optimal quantities of shirts and pajamas to produce given the cutting and sewing time constraints.

Uploaded by

ChieMae Benson Quinto
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
266 views

10a-Linear Programming

Here is the linear programming model for this problem: Let: X1 = Number of shirts produced X2 = Number of pajamas produced Maximize: Z = 4X1 + 3X2 Subject to: Cutting: 1.5X1 + 2X2 ≤ 450 Sewing: X1 + 0.75X2 ≤ 280 Non-negativity: X1, X2 ≥ 0 The objective is to maximize total profit contribution by determining the optimal quantities of shirts and pajamas to produce given the cutting and sewing time constraints.

Uploaded by

ChieMae Benson Quinto
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

LINEAR PROGRAMMING

Linear Programming (LP) Models

 LP techniques consists of a sequence of


steps that will lead to an optimal solution
to linear-constrained problems, if an
optimum solution exists.

 Used to determine an optimal allocation of


an organization’s limited resources among
competing demand.
Applications of LP

 Establishing locations for emergency


equipment and personnel that will
maximize response time.

 Determining optimal schedules for airlines’


planes, pilots, and ground personnel.

 Developing financial plans.


Applications of LP
 Determining optimal blends of animal feed
mixes.

 Determining optimal diet plans.

 Identifying the best set of worker-job


assignments.

 Developing optimal production schedules.


Four components of LP model

1. Objective function

2. Decision variables

3. Constraints

4. Parameters
Objective function

A measure of goal attainment

Two general types:


 Maximization
 Profits, revenues, efficiency, or rate of return

 Minimization
 Cost, time, distance travelled, or scrap
Decision variables
 Amounts of either inputs or outputs
 Variables whose values are unknown and are searched
for
Constraints
 Limitations that restrict the available alternatives.
 Assumed to be linear

Parameters
 Numerical constraints
Formulating LP Models
1. Identify the decision variables
2. Determine the objective function
3. Identify the constraints
4. Determine appropriate values for
parameters and whether an upper limit,
lower limit, or equality is called for
5. Use this information to build a model
6. Validate the model
Assumptions of LP Model

 Linearity

 Divisibility

 Certainty

 Non-negativity
Sample LP Model Formulation
Let:
X1 = Quantity of product 1 to produce
X2 = Quantity of product 2 to produce
X3 = Quantity of product 3 to produce
Maximize:
z = 5X1 + 8X2 + 4X3
Subject to:
Labor 2X1 + 4X2 + 8X3 ≤ 250 hours
Materials 7X1 + 6X2 + 5X3 ≤ 100 kg
Product 1 X1 ≥ 10
X1, X2, X3 ≥ 0
Example (Product Mix):
A firm that assembles computers is about to
start production of two new
microcomputers. Each type of
microcomputer will require assembly time,
inspection time, and storage space. The
manager of the firm would like to
determine the quantity of each product to
produce in order to maximize profit.
Example (Product Mix):

The following information were obtained for


the new products:

Type 1 Type 2
Profit per unit $60 $50
Assembly time per unit 4 hours 10 hours
Inspection time per unit 2 hours 1 hour
Storage space per unit 3 cubic ft 3 cubic feet
Example (Product Mix):

The manager also has acquired the


information on the availability of company
resources:

Assembly time 100 hours


Inspection time 22 hours
Storage space 39 cubic feet
Example (Product Mix):

The manager also met with the firm’s


marketing manager and learned that
demand for the microcomputers was such
that whatever combination of these two
types product is produce, all of the output
can be sold.
Answer: (Product Mix)
Let:
X1 = Quantity of type 1 product to produce
X2 = Quantity of type 2 product to produce
Maximize:
z = 60X1 + 50X2
Subject to:
Assembly 4X1 + 10X2 ≤ 100 hours
Inspection 2X1 + 1X2 ≤ 22 hours
Storage 3X1 + 3X2 ≤ 39 cu. feet
Non-negativity X1, X2 ≥ 0
Example (Diet problem):

A cereal manufacturer is investigating the


possibility of introducing a new cereal. It would
be composed of wheat, rice, and corn flakes.
The cost per ounce and dietary requirements
are shown in the following table.
Formulate an LP model for this problem that will
determine the optimal quantities of wheat,
rice, and corn per box that will achieve the
requirements at minimum cost.
Example (Diet problem):

Wheat Rice Corn Req’t per 12


oz box
Protein (g/oz) 4 2 2 At least 27 g
Carbohydrates 20 25 21 At least 240g
Calories per oz. 90 110 100 No more than
1,260 calories
Cost per oz. $0.03 $0.05 $0.02
Answer: (Diet problem)
Let:
X1 = Amount of wheat
X2 = Amount of rice
X3 = Amount of corn
Minimize:
z = 0.03 X1 + 0.05 X2 + 0.02 X3
Subject to:
Protein 4X1 + 2X2 + 2X3 ≥ 27 grams
Carbo 20X1 + 25X2 + 21X3 ≥ 240 grams
Calories 90X1 + 110X2 100X3 ≤ 1,260 cal
Non-negativity X1, X2, X3 ≥ 0
Example (Portfolio Selection)

 An investor has $100,000 to invest. He has


decided to use three vehicles for
generating income: bonds, certificate of
deposit (CD), and a money market
account. The investor also has identified
several additional restrictions on the
investments:
Example (Portfolio Selection)

1. No more than 40 percent of the investment


should be in bonds.
2. The proportion allocated to the money
market account should be at least double
the amount in CD.

The annual return will be 8% for bonds, 9% for


CD, and 7% for money market account.
Assume the entire amount will be invested.
Example (Portfolio Selection)

Formulate the LP model for this problem,


ignoring any transaction costs and the
potential for different investment lives.
Assume that the investor wants to
maximize the total annual return.
Answer: (Product Mix)
Let:
X1 = Amount to invest in bonds
X2 = Amount to invest in CD
X3 = Amount to invest in money market account
Maximize:
z = 0.08 X1 + 0.09 X2 + 0.07 X3
Subject to:
avail amt. X1 + X2 + X3 = 100,000
restriction X1 ≤ 40,000
X3 ≥ 2X2
Non-negativity X1, X2, X3 ≥ 0
END
Seatwork:
A clothing manufacturer produces men’s shirt and pajama
which both requires cutting and sewing operation. Over
the next month, the owner can schedule up to 280 hours
of work on sewing machines and up to 450 hours of work
on cutting machines. Each shirt produce requires 1 hour of
sewing and 1.5 hours of cutting while each pair of pajama
requires 0.75 hours of sewing and 2 hours of cutting.
Each shirt produced will yield a $4 contribution to profit
and that each pair of pajamas will yield a $3 contribution
to profit.
Determine the optimal number of shirt and pajama to
produced.

You might also like