FIRST LONG EXAM PROBLEM 1:

Bloomington Bakery bakes two types of cake (chocolate

and vanilla) to supplement its income. Each chocolate
cake can be sold for $1.0, and each vanilla cake can be
sold for $0.50. Each chocolate cake requires 20 minutes
of baking time and uses 4 eggs. Each vanilla cake requires
40 minutes of baking time and uses 1 egg. Eight hours of
baking time and 30 eggs are available.
A. Formulate an LP that will maximize Bloomington
Bakery’s revenue.
B. Solve the LP graphically and interpret its results.
FIRST LONG EXAM PROBLEM 2:

Stark Co. manufactures tables and chairs. Each table and

chair must be made entirely out of oak or entirely out of
pine. A total of 150 board ft of oak and 210 board ft of
pine are available. A table requires either 17 board ft of
oak or 30 board ft of pine, and a chair requires either 5
board ft of oak or 13 board ft of pine. Each table can be
sold for $40, and each chair for $15.
A. Formulate an LP that can be used to maximize
revenue.
B. Solve the LP by simplex method and interpret its
results.
ARTIFICIAL STARTING
SOLUTIONS

MARY JOYCE P. ALCAZAR

Instructor I
Department of Industrial Engineering and Technology
College of Engineering and Information Technology
Cavite State University – Main Campus

First Semester, AY 2018 – 2019

ARTIFICIAL STARTING SOLUTIONS

As demonstrated in the previous examples,

LPs in which all the constraints are (≤)
with nonnegative right-hand sides offer a
convenient all-slack basic feasible solution.
Models involving (=) and/or (≥)
constraints do not.
ARTIFICIAL STARTING SOLUTIONS

The procedure for starting “ill-behaved”

LPs with (=) and (≥) constraints is to use
artificial variables that play the role of
slacks at the first iteration, and then dispose
them legitimately at a later iteration.
ARTIFICIAL STARTING SOLUTIONS

Two closely related methods will be

introduced:
 Big-M Method
 Two-Phase Method
BIG-M METHOD

MARY JOYCE P. ALCAZAR

Instructor I
Department of Industrial Engineering and Technology
College of Engineering and Information Technology
Cavite State University – Main Campus

First Semester, AY 2018 – 2019

ARTIFICIAL STARTING SOLUTIONS

The Big-M Method starts with the LP in

equation form. If equation i does not have a
slack, an artificial variable, R, is added to
form a starting solution similar to the
convenient all-slack basic solution.
ARTIFICIAL STARTING SOLUTIONS

However, because the artificial variables

are not part of the original LP model, they
are assigned to a very high penalty in the
objective function, thus forcing them
(eventually) to equal zero in the optimal
solution.
ARTIFICIAL STARTING SOLUTIONS

Penalty Rule for Artificial Variables:

Given M, a sufficiently large positive value
(mathematically, M → ∞), the objective coefficient of an
artificial variable represents an appropriate penalty if:
Artificial variable objective coefficient:

-Min maximization problems

+M in minimization problems
EXAMPLE 7:
ORANJ BY BEVCO
Bevco manufactures an orange-flavored soft drink
called Oranj by combining orange soda and orange juice.
Each ounce of orange soda contains 0.5oz of sugar and
1mg of Vitamin C. Each ounce of orange juice contains
0.25oz of sugar and 3mg of Vitamin C. It costs Bevco 2¢ to
produce an ounce of orange soda and 3¢ to produce an
ounce of orange juice. Bevco’s marketing department has
decided that each 10oz bottle of Oranj must contain at least
20mg of Vitamin C and at most 4oz of sugar. Use linear
programming to determine how Bevco can meet the
marketing department’s requirement at minimum cost.
EXAMPLE 7:
ORANJ BY BEVCO
LP Model:
Min z = 2¢x1 + 3¢x2
Subject To:
1/2x1 + 1/4x2 ≤ 4
x1 + 3x2 ≥ 20
x1 + x2 = 10
x1, x2 ≥ 0
EXAMPLE 7:
ORANJ BY BEVCO

New Initial Tableau:

new z row = old z row + Σ(M * Rn row)

EXAMPLE 7:
ORANJ BY BEVCO

Entering Variable: most positive value in the z-row

(Assume M = 100)

Leaving Variable: least positive ratio

EXAMPLE 7:
ORANJ BY BEVCO
Optimal Solution:
z = 25
x1 = 5
x2 = 5
S1 = 1/4
S2 = 0
R1 = 0
R2 = 0