Linear Programming Part 1

Linear
Programming
OBJECTIVES :
After studying this module, you should be able to:
1. Understand and define linear programming.

2. Identify all necessary items that must be included in a model.
3. Write a verbal statement of the objective function and each constraint.
4. Define the decision variables.
5. Write the objective function in terms of the decision variables.
6. Write the constraints in terms of the decision variables.
7. Makes a decision about the solution of the problem.
Linear Programming
• It is a computer science technique to address issues of optimization process.
• The word "linear" implies the linearity of all mathematical relationships
within a model.
• The standard model is the set of linear equations and/or inequalities (called
constraints) and the linear objective function (to be maximized or minimized).
Linear Programming
• The constraints of non-negativity are also included in the model.
• The manager's aim is to find the right solution for the highest objective
function value
Summary of LP Model
Formulation Steps
STEP 1: DEFINE THE DECISION VARIABLES.
Decision variables are mathematical symbols that represent levels of activity.
STEP 2: DEFINE THE OBJECTIVE FUNCTION.

Objective function is a linear relationship that reflects the objective of an operation.
STEP 3: DEFINE THE CONSTRAINTS.

A model constraint is a linear relationship that represents a
restriction on decision making.
Nonnegativity constraints restrict the decision variables

to zero or positive values.
Problem #1:
Beaver Creek Pottery Company is a small
crafts operation run by a Native American
tribal council. The company employs skilled
artisans to produce clay bowls and mugs with
authentic Native American designs and colors.
The two primary resources used by the
company are special pottery clay and skilled
labor. Given these limited resources, the
company desires to know how many bowls and
mugs to produce each day in order to maximize
profit. This is generally referred to as a product
mix problem type. This scenario is illustrated
in Figure 2.1.
STEP 1: Define the decision
variables.
STEP 2: Define the objective
function.
STEP 3: Define the constraints.
Clay: 120lb/day
Labor: 40hrs./day
The “less than or equal to”

inequality is employed instead of
an equality because it is the
maximum limitation that can be
used, not an amount that must be
used.
Linear Programming Model
Problem #2:
A carpenter makes bookcases in two sizes, small and large. It takes 6 hours to build a
large one and 2 hours to build a small one. The profit from a large bookcase is $50 and the profit
from a small bookcase is $20. The carpenter can spend only 24 hours a week making bookcases,
and must make at least 2 large and 3 small each week. Find his maximum profit per week.
STEP 1: DEFINE THE DECISION VARIABLES.
L = # of large bookcases
S= # of small bookcases
STEP 2: DEFINE THE OBJECTIVE FUNCTION.
Z= 5OL + 20S
STEP 3: DEFINE THE CONSTRAINTS.
6L + 2S 24
L 2
S 3
L, S 0
Linear Programming Model
Maximize Z= 5OL + 20S
Subject to
6L + 2S 24
L 2
S 3
L, S 0
Problem #3:
Consider a chocolate manufacturing company that produces only two types of chocolate –
A and B. Both the chocolates require Milk and Choco only. To manufacture each unit
of A and B, the following quantities are required:
• Each unit of A requires 1 unit of Milk and 3 units of Choco
• Each unit of B requires 1 unit of Milk and 2 units of Choco
The company kitchen has a total of 5 units of Milk and 12 units of Choco. On each sale, the
company makes a profit of
• $6 per unit A sold
• $ 5 per unit B sold.
Now, the company wishes to maximize its profit. How many units of A and B should it
produce respectively?
Problem #4:
ABC, Inc. creates 2 types of toys: car and boat. The car is priced at P550,
and the boat at P700. The wood cost of the car is P50, while P70 for the boat. The
car needs 1 hour of woodwork labor and 1 hour of painting and assembling labor.
The boat requires 2 hours of woodwork labor and1 hour of painting and assembling
labor. Cost of woodwork labor is P30 per hour, worth of painting and assembling
labor is P20 per hour. Monthly, ABC has 5000 existing hours of woodwork labor
and 3000 hours of painting and assembling labor. There is an unlimited demand for
boat, while an average demand for car is at most 2000. ABC wants to get the best
out of monthly profit
Problem #5:
Quick-Screen is a clothing manufacturing company that specializes in producing
commemorative shirts immediately following major sporting events such as the World Series,
Super Bowl, and Final Four. The company has been contracted to produce a standard set of
shirts for the winning team, either State University or Tech, following a college football bowl
game on New Year’s Day. The items produced include two sweatshirts, one with silk-screen
printing on the front and one with print on both sides, and two T-shirts of the same
configuration. The company has to complete all production within 72 hours after the game, at
which time a trailer truck will pick up the shirts. The company will work around the clock.
The truck has enough capacity to accommodate 1,200 standard-size boxes. A standardize box
holds 12 T-shirts, and a box of 12 sweatshirts is three times the size of a standard box. The
company has budgeted $25,000 for the production run. It has 500 dozen blank sweatshirts and
T-shirts each in stock, ready for production.
Problem #5:
The resource requirements, unit costs, and profit per dozen for each type of shirt are
shown in the following table:
The company wants to know how many dozen (boxes) of each type of shirt to produce in order to
maximize profit.
Problem #6:
A farmer is preparing to plant a crop in the spring and needs to fertilize a field. There are two
brands of fertilizer to choose from, Super-gro and Crop-quick. Each brand yields a specific
amount of nitrogen and phosphate per bag, as follows:
The farmer’s field requires at least 16 pounds of

nitrogen and at least 24 pounds of phosphate. Super-
gro costs $6 per bag, and Crop-quick costs $3. The
farmer wants to know how many bags of each brand to
purchase in order to minimize the total cost of
fertilizing.

Linear Programming Part 1

Uploaded by

Linear Programming Part 1

Uploaded by

Linear

1. Understand and define linear programming.

STEP 2: DEFINE THE OBJECTIVE FUNCTION.

STEP 3: DEFINE THE CONSTRAINTS.

Nonnegativity constraints restrict the decision variables

The “less than or equal to”

The farmer’s field requires at least 16 pounds of

You might also like