Scribd
Upload
1K views4 pages

Chapter 2

This document contains a student's answers to problems in a chapter about linear programming. Some key points: 1) The student identifies which mathematical relationships can and cannot be used in a linear programming model, and why some are nonlinear. 2) Solutions are provided for constraints involving inequalities and equalities relating variables A and B. 3) Graphs are drawn showing the objective function values for three different linear programs. 4) A linear program is written in standard form. 5) For a given linear program, the student finds the optimal solution and identifies the binding and non-binding constraints. 6) For a production planning problem, the student notes that the proposed solution cannot be

Uploaded by

Cleofe Mae Piñero Aseñas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views4 pages

Chapter 2

This document contains a student's answers to problems in a chapter about linear programming. Some key points: 1) The student identifies which mathematical relationships can and cannot be used in a linear programming model, and why some are nonlinear. 2) Solutions are provided for constraints involving inequalities and equalities relating variables A and B. 3) Graphs are drawn showing the objective function values for three different linear programs. 4) A linear program is written in standard form. 5) For a given linear program, the student finds the optimal solution and identifies the binding and non-binding constraints. 6) For a production planning problem, the student notes that the proposed solution cannot be

Uploaded by

Cleofe Mae Piñero Aseñas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ASEÑAS, CLEOFE MAE P.

CBA-BSA II
BSA 23C- B
CHAPTER 2- PROBLEMS

1.) Which of the following mathematical relationships could be found in a linear programming
model, and which could not? For the relationships that are unacceptable for lines programs,
state why.

a. - 1A + 2B ≤ 70
b. 2A - 2B = 50
c. 1A - 2B² ≤ 10
d. 3√A + 2B ≥ 15
e. 1A + 1B= 6
f. 2A + 5B + 1AB ≤ 25

ANSWER:

● a, b, and e, are acceptable linear programming relationships.


● c is not acceptable because of -2B²
● d is not acceptable because of 3√A
● f is not acceptable because of 1AB
● c, d, and f could not be found in a linear programming model because because they have the above
nonlinear terms.

2.) Find the solutions that satisfy the following constraints;


a. 4A + 2B ≤ 16
b. 4A + 2B ≥ 16
c. 4A + 2B = 16

ANSWER:

1
ASEÑAS, CLEOFE MAE P.
CBA-BSA II
BSA 23C- B
CHAPTER 2- PROBLEMS
2
6.) Three objective functions for linear programming problems are 7A + 10B, 6A + 4B, and -44 + 7B.
Show the graph of each for objective function values equal to 420.

ANSWER:

17.) Write the following linear program in standard form:

Max 5A + 2B
s.t.
1A - 2B ≤ 420
2A + 3B ≤ 610
6A - 1B ≤ 125
A, B ≥ 0

ANSWER:

2
ASEÑAS, CLEOFE MAE P.
CBA-BSA II
BSA 23C- B
CHAPTER 2- PROBLEMS
3

21.) Consider the following linear program:


Max 2A + 3B
s.t
5A + 5B ≤ 400 Constraint 1
- 1A + 1B ≤ 10 Constraint 2
1A + 3B ≥ 90 Constraint 3
A, B ≥ 0

ANSWER:

a. and b.

c. Optimal solution occurs at the intersection of constraints 1 and 2. For constraint 2,


B = 10 + A

Substituting for B in constraint 1 we obtain


5A+ 5 (10+A) = 400
5A+ 50+ 5A = 400
10A = 350
A = 35

3
ASEÑAS, CLEOFE MAE P.
CBA-BSA II
BSA 23C- B
CHAPTER 2- PROBLEMS
4
B = 10 + A = 10 + 35 = 45

Optimal solution is A = 35, B = 45

d. Because the optimal solution occurs at the intersection of constraints 1 and 2, these are binding constraints.

e. Constraint 3 is the nonbinding constraint. At the optimal solution 1A + 3B = 1(35) + 3(45) = 170. Because
170 exceeds the right-hand side value of 90 by 80 units, there is a surplus of 80 associated with this constraint.

55.) ¡The Kariek Company is trying to determine how much of each of two products to produce over the
coming planning period. There are Three departments, A, B and C, with limited
labor hours available in each department, Eachproduct must be processed by each department and the
per-unit requirements for each product , labor hours available, and per-unit profit are as shown below. (
page. 82)

ANSWER:
Mr. Krtick’s solution cannot be optimal. Every department has unused hours, so there are no binding
constraints. With unused hours in every department, clearly some more product can be made.

You might also like