A Costo unitario de envío

De Cliente 1 Cliente 2 Cliente 3

Fabrica 1 $ 600 $ 800 $ 700 b) Resuelva el modelo por el modelo simplex.
Fabrica 2 $ 400 $ 900 $ 600
Orden 300 unid 200 unid 400 unid
C=
C 600Xf1-c1 - 800Xf1-c2 - 700Xf1-c3 - 400Xf2-c1 - 900Xf2-c2 - 600Xf2-c3 +MX1 + MX2 + MX3 + MX4 + MX

Grados de libertad= 10-5

Grados de libertad = 5

variables artificiales.

Xf1-c1 + Xf1-c2 + Xf1-c3 + X1= 400
Xf2-c1 + Xf2-c2 + Xf3-c3 + X2= 500
Xf1-c1 + Xf2-c1 + X3= 300
Xf1-c2 + Xf2-c2 + X4= 200
Xf1-c3 + Xf2-c3 + X5= 400

Vb C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3

C -1 600 800 700 400 900 600
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1

-Mf2 + f1

Vb C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3

C -1 600-M 800-M 700-M 400 900 600
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1

-Mf3 + f1
 Vb C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3
C -1 600-M 800-M 700-M 400-M 900-M 600-M
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1

-Mf4 + f1

Vb C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3

C -1 600-2M 800-M 700-M 400-2M 900-M 600-M
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1

-Mf5 + f1

Vb C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3

C -1 600-2M 800-2M 700-M 400-2M 900-2M 600-M
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1

-Mf6 + f1

b C Xf1-c1 Xf1-c2 Xf1-c3 Xf2-c1 Xf2-c2 Xf2-c3

C -1 600-2M 800-2M 700-2M 400-2M 900-2M 600-M
X1 0 1 1 1 0 0 0
X2 0 0 0 0 1 1 1
X3 0 1 0 0 1 0 0
X4 0 0 1 0 0 1 0
X5 0 0 0 1 0 0 1
l modelo simplex.

3 +MX1 + MX2 + MX3 + MX4 + MX5

X1 X2 X3 X4 X5 LD
M M M M M 0
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400

X1 X2 X3 X4 X5 LD
0 M M M M (-400M)
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400
X1 X2 X3 X4 X5 LD
0 0 M M M (-900M)
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400

X1 X2 X3 X4 X5 LD
0 0 0 M M (-1200M)
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400

X1 X2 X3 X4 X5 LD
0 0 0 0 M (-1400M)
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400

X1 X2 X3 X4 X5 LD
0 0 0 0 0 (-1800M)
1 0 0 0 0 400
0 1 0 0 0 500
0 0 1 0 0 300
0 0 0 1 0 200
0 0 0 0 1 400
D7 The Trim-Look Company makes several lines of skirts, dresses, and sport coats. Recently, a consultant suggested tha
maximize contribution to profits and to overhead. Each product requires the same polyester fabric and must pass th

Processing Time (hr)

Product Cutting Sewing Material (yd)

Skirt 2 1 1
Dress 4 4 1
Sport coat 6 6 4

The Butterfield Company makes a variety of knives. Each knife is processed on four machines. The processing times
d,10 1,590 for machine 3; and 1,500 for machine 4.

Processing Time (hr)

Knife Machine 1 Machine 2 Machine 3 Machine 4
A 0.05 0.10 0.15 0.05
B 0.15 0.10 0.05 0.05
C 0.20 0.05 0.10 0.20
D 0.15 0.10 0.10 0.10
E 0.05 0.10 0.10 0.05

Each product contains a different amount of two basic materials. Raw material 1 costs $0.50 per ounce, and raw ma
material 2 available.
 Requirements (oz/unit)
Selling Price
Knife Raw Material 1 Raw Material 2
($/unit)
A 3 4 19.50
B 8 7 26.00
C 1 3 14.00
D 1 6 20.50
E 6 10 27.00

a. If the objective is to maximize profit, specify the objective function and constraints for the problem. Assu

Maximize Z 12.00 11.50 9.00

machine 1 0.05 0.15 0.2 0.15

machine 2 0.1 0.1 0.05 0.1
machine 3 0.15 0.05 0.1 0.1
machine 4 0.05 0.05 0.2 0.1
material 1 3 8 1 1
material 2 4 7 3 6

D.2 A business student at Nowledge College must complete a total of 75 courses to graduate. The number of business c
than or equal to 20. The average business course requires a textbook costing $120 and 120 hours of study. Nonbusi
on books.

a. Let
X1 = number of business courses,
X2 = number of nonbusiness courses.

Create a set of linear equations to describe the objective function and the constraints.
Objective function: Minimize x1 x2
Z 120 200
money 120 40
Business course requirement x1+0*x2>=23
Nonbusiness course requirement 0*x1+x2>=20
Total course requirement x1+x2>=75
Nonnegativity constraints: X1, X2>=0.
b. On the graph to the right, the constraints are labeled as follows:
Money constraint: C1
Business course requirement: C2
Nonbusiness course requirement: C3
Total course requirement: C4

c. Now find the solution that optimizes the objective function. Even though all the points in the feasible region re
region need be considered because at least one corner point is better than any interior point. Similarly, other poin
as any of them.

The optimal solution is: X1 30

X2 45

Optimal solution value of the objective function:

Z X1
120

D.Identify the slack or surplus variables.

The binding constraint is a constraint that helps form the optimal corner point. For nonbinding inequality constraint
which the left-hand side falls short of the right-hand side is called slack. For a >= constraint, the amount by which th

Here the constraint of business classes, C2, and of nonbusiness classes, C3, are the nonbinding constraints.

30 - 23 = 7 UNIDADES
45 - 20 = 25 UNIDADES
D.13 A small fabrication firm makes three basic types of components for use by other companies. Each component is pro
and 1,500 for machine 3. The processing times are as follows:

Processing Time (hr)

Component Machine 1 Machine 2 Machine 3
A 0.25 0.10 0.05
B 0.20 0.15 0.10
C 0.10 0.05 0.15

Each component contains a different amount of two basic raw materials. Raw material 1 costs $0.20 per ounce, a
ounces of raw material 2 a

Requirements (oz/unit)
Selling Price
Component Raw Material 1 Raw Material 2
($/unit)
A 32 12 39
B 27 16 26.65
C 20 9 23.4

a. Assume that the company must make at least 1,200 units of component B, that labor costs are negligible,
the problem.

Objective function: Maximize Z A B

29.6 17.25
Machine 1 (C1): 0.25 0.20
Machine 2 (C2): 0.1 0.15
Machine 3 (C3): 0.05 0.1
Material 1 (C4): 32 27
Material 2 (C5): 12 16
Minimum for product (C6): B >= 1200
Nonnegativity constraints: A, B, C >= 0.

b. Use a software package for linear programming, such as with POM for Windows, to solve for t

A 5425
B 1200
C 0

D.20 JPMorgan Chase has a scheduling problem. Operators work eight-hour shifts and can begin work at midnight, 4 A
 Formulate a
linear
programming
model to cover
Time Period Operators Needed the demand Let  
requirements
Midnight to 4 A.M. 5 with the X1
4 A.M. to 8 A.M. 7 minimum number X2
of operators.
8 A.M. to noon 90 X3
Noon to 4 P.M. 70 X4
4 P.M. to 8 P.M. 40 X5
8 P.M. to midnight 20 X6

X1 X2 X3
Objective function: Minimize Z 1 1 1
X1+X6>=5 X1+X2>=7 X2+X3>=90

D,13 A small fabrication firm makes three basic types of components for use by other companies. Each component is pr
and 1,600 for machine 3. The process

Processing Time (hr)

Component Machine 1 Machine 2 Machine 3
A 0.25 0.10 0.05
B 0.20 0.15 0.10
C 0.10 0.05 0.15

Each component contains a different amount of two basic raw materials. Raw material 1 costs $0.20 per ounce, and
ounces of raw material 2 are available.

Requirements (oz/unit)
Selling Price
Component Raw Material 1 Raw Material 2
($/unit)
A 32 12 40
B 26 16 28
C 19 9 24

a. Assume that the company must make at least 1,200 units of component B, that labor costs are negligible,
the problem.

Objective function: Maximize Z A B

 29.40 17.20
Machine 1 (C1): 0.25 0.20
Machine 2 (C2): 0.1 0.15
Machine 3 (C3): 0.05 0.1
Material 1 (C4): 32 26
Material 2 (C5): 12 16
Minimum for product (C6): B >= 1200
Nonnegativity constraints: A, B, C >= 0.

b. Use a software package for linear programming, such as with POM for Windows, to solve for t

A 5400
B 1200
C 0

D,16 The Warwick Manufacturing Company produces shovels for industrial and home use. Sales of the shovels are sea
customers want to minimize inventory, insist on shipments accordi

Warwick employs manual, unskilled laborers who require only basic training. Producing 1,000 shovels costs $3,500
than 85 percent of the cost. Overtime is limited to production of 15,000 shovels per quarter. In addition, subcontra
production to 10,000 shove

The current level of inventory is 35,000 shovels, and management wants to end the year at that level. Holding 1,000

Demand
Quarter
(thousands)
1 200
2 320
3 150
4 100
Totals 770

Build a linear programming model to determine the best regular-time capacity plan.
Assume the
following:

1. The firm has 30 workers now, and management wants to have the same number in quarter 4.
2. Each worker can produce 4,000 shovels per quarter.
3. Hiring a worker costs $900, and laying off a worker costs $600.

Let

It = number of shovels to be left over as inventory in perio

Wt = number of workers in period t,
 Ht = number of workers hired in period t,
Ft = number of workers fired in period t,
Ot = number of shovels produced by overtime,
St = number of shovels produced by subcontracting,
Dt = forecasted demand in period t.

All production units are in thousands.

If the objective is to minimize the cost, specify the objective function.

Lt
Objective function: Minimize Z Summation from 1 to 4∑($ 300

First determine the cost for Wt. Note that each worker can produce 4,000 shovels per quarter, at a cost of $3,500 p

4000 PALAS / QUARTO 3500/1000 $ 14,000

1st quarter 4W1 + O1 + S1 + I0 -I1 = 200

2nd quarter 4W2 + O2 + S2 + I1 -I2 = 320
3rd quarter 4W3 + O3 + S3 + I2 -I3 = 150
4th quarter 4W4 + O4 + S4 + I3 -I4 = 100

Note that the current level of inventory is 35 thousand shovels, and management wants to en

I0=35
I4=35.

Wt - Wt-1 - Ht + Ft = 0.

W0=30
W4=30

Ot ≤15
St ≤10

The total cost is

$ 2,775,625
ly, a consultant suggested that the company reevaluate its South Islander line and allocate its resources to products that would
yester fabric and must pass through the cutting and sewing departments. The following data were collected for the study.

The cutting department has 110 hours of capacity, sewing has 210 hours of capacity,
and 60 yards of material are available. Each skirt contributes $10 to profits and
overhead; each dress, $18; and each sport coat, $32.
a.
Let
X1 = number of skirts produced,
X2 = number of dresses produced,
X3 = number of sport coats produced.

Specify the objective function and constraints for the problem.

Z 10 18 32
Cutting 2 4 6 <= 110
Sewing 1 4 6 <= 210
Material (yd) 1 1 4 <= 60

chines. The processing times required are as follows. Machine capacities (in hours) are 1510 for machine 1; 1,400 for machine 2;

$0.50 per ounce, and raw material 2 costs $1.50 per ounce. There are 100,000 ounces of raw material 1 and 95,000 ounces of raw
 1.5 6 7.5 12.00
4 10.5 14.5 11.50
0.5 4.5 5 9.00
0.5 9 9.5 11.00
3 15 18 9.00

straints for the problem. Assume that labor costs are negligible. Let Xi = number of knife i (i = A, B, C, D, and E) produced.

11.00 9.00

0.05 <= 1510 X1 7875

0.1 <= 1400 X2 5575
0.1 <= 1590
0.05 <= 1500
6 <= 100000
10 <= 95000

ate. The number of business courses must be greater than or equal to 23. The number of nonbusiness courses must be greater
d 120 hours of study. Nonbusiness courses require a textbook costing $40 and 200 hours of study. The student has $5,400 to spend

<= 5400
oints in the feasible region represent possible solutions, limit the search to the corner points. No interior points in the feasible
or point. Similarly, other points on the boundary of the feasible region can be ignored because a corner point is at least as good

X2
200 = 12600

nbinding inequality constraints, knowing how much the left and right sides differ is helpful. For a <= constraint, the amount by
raint, the amount by which the left-hand side exceeds the right-hand side is called surplus.

nbinding constraints.
anies. Each component is processed on three machines. Total capacities (in hours) are 1,600 for machines 1; 1,400 for machine 2;

ial 1 costs $0.20 per ounce, and raw material 2 costs $0.25 per ounce. At present, 206,000 ounces of raw material 1 and 90,000
ounces of raw material 2 are available.

6.4 3 9.4 29.60

5.4 4 9.4 17.25
4 2.25 6.25 17.15

t labor costs are negligible, and that the objective is to maximize profits. Specify the objective function and constraints for
the problem.

C
17.15
0.10 <= 1600
0.05 <= 1400
0.15 <= 1500
20 <= 206000
9 <= 90000

M for Windows, to solve for the optimal solution. A linear programming software shows the optimal solution as:

n begin work at midnight, 4 A.M., 8 A.M., noon, 4 P.M., or 8 P.M. Operators are needed to satisfy the following demand pattern.
 = number of operators working from midnight to 8 A.M.,
= number of operators working from 4 A.M. to noon,
= number of operators working from 8 A.M. to 4 P.M.,
= number of operators working from noon to 8 P.M.,
= number of operators working from 4 P.M. to midnight, and
= number of operators working from 8 P.M. to 4 A.M.

X4 X5 X6
1 1 1
X3+X4>=70 X4+X5>=40 X5+X6>=20

panies. Each component is processed on three machines. Total capacities (in hours) are 1,600 for machines 1; 1,500 for machine 2;
00 for machine 3. The processing times are as follows:

1 costs $0.20 per ounce, and raw material 2 costs $0.35 per ounce. At present, 204,000 ounces of raw material 1 and 110,000

6.4 4.2 10.6 29.40

5.2 5.6 10.8 17.20
3.8 3.15 6.95 17.05

t labor costs are negligible, and that the objective is to maximize profits. Specify the objective function and constraints for
the problem.

C
 17.05
0.10 <= 1600
0.05 <= 1500
0.15 <= 1600
19 <= 204000
9 <= 110000

M for Windows, to solve for the optimal solution. A linear programming software shows the optimal solution as:

e. Sales of the shovels are seasonal, and Warwick's customers refuse to stockpile them during slack periods. In other words, the
y, insist on shipments according to their schedules, and will not accept backorders.

ng 1,000 shovels costs $3,500 on regular time and $3,700 on overtime. These amounts include materials, which account for more
uarter. In addition, subcontractors can be hired at $4,500 per thousand shovels, but Warwick's labor contract restricts this type of
production to 10,000 shovels per quarter.

ar at that level. Holding 1,000 shovels in inventory costs $300 per quarter. The latest annual demand forecast is as follows:

left over as inventory in period t (t = 0, 1, 2, 3, 4),

 ced by overtime,
ced by subcontracting,

Wt Ot St Ht Ft
$ 14,000 3700 4500 900 600

quarter, at a cost of $3,500 per 1,000. Then the cost for Wt is

and management wants to end the year at that level. The end-of-year inventory constraints:
oducts that would
or the study.

0 hours of capacity,
o profits and

todo tiene que ser mayor o igual que 0

x1, x2, x3 >= 0

problema de pow averiguar

,400 for machine 2;

95,000 ounces of raw

E) produced.

s must be greater
has $5,400 to spend
ints in the feasible
nt is at least as good

t, the amount by
1,400 for machine 2;

terial 1 and 90,000

n and constraints for

n as:

g demand pattern.
 1,500 for machine 2;

al 1 and 110,000

n and constraints for

n as:

n other words, the

ch account for more

restricts this type of

is as follows:
Activity Description
A Interview for new manager
B Renovate building
C Place ad for associates and interview applicants
D Have new manager prospects visit
E Purchase equipment for new store and install
F Check employee applicant references and make final selection
G Check references for new manager and make final selection
H Hold orientation meetings and do payroll paperwork

Activity Description
A Interview for new manager
B Renovate building
C Place ad for associates and interview applicants
D Have new manager prospects visit
E Purchase equipment for new store and install
F Check employee applicant references and make final selection
G Check references for new manager and make final selection
H Hold orientation meetings and do payroll paperwork
 Time (weeks)
Immediate Predecessor(s) a m b form
- 1 2 7 2.67
- 5 7 15 8
- 5 8 11 8
A 1 3 5 3
B 1 4 7 4
C 6 7 14 8
D 1 1 7 2
E, F, G 4 5 6 5

A D
2.67 3 G
2
S B E
8 4 H
5
C F
8 8

Te 21 goal 19

O2c 1 1.00
O2f 1.333 1.78 O2 2.89
O2h 0.333 0.11

Time (weeks)
Immediate Predecessor(s) a m b form
- 2 3 7 3.50
- 5 6 19 8
- 3 4 5 4
A 1 2 9 3
B 1 3 5 3
C 4 5 12 6
D 1 2 3 2
E, F, G 4 5 6 5

A D
3.50 3 G
 2
S B E
8 3 H
5
C F
4 6

Te 16 goal 12

O2b 2.333 5.44

O2e 0.667 0.44 O2 6.00
O2h 0.333 0.11
A,D,G,H B,E,H C,F,H
12.67 17 21

Z -2 -1.18
1.6996732

1 0.881 0.119

A,D,G,H B,E,H C,F,H

13.50 16 15
Z -4 -1.63
2.4494897

1 0.9485 0.0515