Linear Programming Exercises, Assignments of Business Administration

A collection of exercises related to linear programming, a mathematical technique used for optimizing resource allocation and decision-making. The exercises cover various aspects of linear programming, including constraint formulation, objective function definition, and problem-solving techniques. These exercises are suitable for students studying operations research, management science, or related fields.

Typology: Assignments

2024/2025

Available from 01/18/2025

Academically
Academically 🇺🇸

4.1

(8)

1.5K documents

1 / 11

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1. A company makes two products from steel; one requires 2 tons of steel and the other requires 3 tons. There
are 100 tons of steel available daily. A constraint on daily production could be written as: 2x1 + 3x2 100.
True
Fals
e
2. Let x1 , x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done
(1). Which answer below indicates that at least two of the projects must be done?
x1 + x2 + x3 = 2
x1 x2 = 0
x1 + x2 + x3 2
x1 + x2 + x3 2
3. The constraint x1 + x2 + x3 + x4 2 means that two out of the first four projects must be selected.
True
Fals
e
4. Each point on the efficient frontier graph associated with the Markowitz portfolio model is
the minimum possible risk for the given return.
maximum return for the least risk.
maximum possible risk for the given return.
minimum diversification for the least risk.
5. Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes
before eventually leaving the city. When represented with a network,
None of the alternatives is
correct. the arcs represent one
way streets. the nodes represent
stoplights.
the nodes represent locations where speed limits change.
6. Assuming W1, W2 and W3 are 0 -1 integer variables, the constraint W1 + W2 + W3 < 1 is often called a
multiple-choice constraint.
k out of n alternatives constraint.
mutually exclusive constraint.
corequisite constraint.
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Linear Programming Exercises and more Assignments Business Administration in PDF only on Docsity!

  1. A company makes two products from steel; one requires 2 tons of steel and the other requires 3 tons. There are 100 tons of steel available daily. A constraint on daily production could be written as: 2 x 1 + 3 x 2 ≤ 100. True Fals e
  2. Let x 1 , x 2 , and x 3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done (1). Which answer below indicates that at least two of the projects must be done? x 1 + x 2 + x 3 = 2 x 1 −x 2 = 0 x 1 + x 2 + x 3 ≥ 2 x 1 + x 2 + x 3 ≤ 2
  3. The constraint x 1 + x 2 + x 3 + x 4 ≤ 2 means that two out of the first four projects must be selected. True Fals e
  4. Each point on the efficient frontier graph associated with the Markowitz portfolio model is the minimum possible risk for the given return. maximum return for the least risk. maximum possible risk for the given return. minimum diversification for the least risk.
  5. Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city. When represented with a network, None of the alternatives is correct. the arcs represent one way streets. the nodes represent stoplights. the nodes represent locations where speed limits change.
  6. Assuming W 1 , W 2 and W 3 are 0 -1 integer variables, the constraint W 1 + W 2 + W 3 < 1 is often called a multiple-choice constraint. k out of n alternatives constraint. mutually exclusive constraint. corequisite constraint.

Supplier 123 Capacity 550 950 800

  1. Let M be the number of units to make and B be the number of units to buy. If it costs $2 to make a unit and $ to buy a unit and 4000 units are needed, the objective function is Max 2M + 3B Min 4000 (M + B) Max 8000M + 12000B Min 2M + 3B
  2. The dual price for a constraint that compares funds used with funds available is .058. This means that the cost of additional funds is 5.8%. no more funds are needed. the objective was to minimize. if more funds can be obtained at a rate of 5.5%, some should be. 9. Problem 9-11 (Algorithmic) Edwards Manufacturing Company purchases two component parts from three different suppliers. The suppliers have limited capacity, and no one supplier can meet all the company’s needs. In addition, the suppliers charge different prices for the components. Component price data (in price per unit) are as follows: Supplier Compone nt 1 2 3 1 $12 $ 4 $ 5 2 $11 $ 0 $ 0 Each supplier has a limited capacity in terms of the total number of components it can supply. However, as long as Edwards provides sufficient advance orders, each supplier can devote its capacity to component 1, component 2, or any combination of the two components, if the total number of units ordered is within its capacity. Supplier capacities are as follows: If the Edwards production plan for the next period includes 1025 units of component 1 and 825 units of component 2, what purchases do you recommend? That is, how many units of each component should be ordered from each supplier?
  3. To develop a portfolio that provides the best return possible with a minimum risk, the linear programming model will have an objective function which minimizes total risk.

maximizes return and minimizes risk

  1. The total cost for a waiting line does NOT specifically depend on the cost of a lost customer. the cost of waiting. the cost of service. the number of units in the system.
  2. The media selection model presented in the textbook involves maximizing the number of potential customers reached subject to a minimum total exposure quality rating. True Fals e
  3. Let Pij = the production of product i in period j. To specify that production of product 1 in period 3 and in period 4 differs by no more than 100 units, P 13 −P 14 ≤ 100; P 14 −P 13 ≥ 100 P 13 −P 14 ≤ 100; P 14 −P 13 ≤ 100 P 13 −P 14 ≥ 100; P 14 −P 13 ≥ 100 P 13 −P 14 ≤ 100; P 13 −P 14 ≥ 100
  4. The number of units shipped from origin i to destination j is represented by

cij.

xji.

xij.

cji.

  1. The assumption that arrivals follow a Poisson probability distribution is equivalent to the assumption that the time between arrivals has an exponential probability distribution a uniform probability distribution a normal probability distribution a Poisson probability distribution
  2. If arrivals occur according to the Poisson distribution every 20 minutes, then which is NOT true? λ= 3 arrivals per hour λ= 1/20 arrivals per minute λ= 20 arrivals per hour λ= 72 arrivals per day
  3. The overall goal of portfolio models is to create a portfolio that provides the best balance between risk and return. gains and losses.
  1. The solution to the LP Relaxation of a maximization integer linear program provides an upper bound for the value of the objective function. a lower bound for the value of the objective function. a lower bound for the value of the decision variables an upper bound for the value of the decision variables 25. Problem 10-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Produ ct Order (Units) A 1750 B 500 C 1100 Three machines are available for the manufacturing operations. All three machines can produce all the products at the same production rate. However, due to varying defect percentages of each product on each machine, the unit costs of the products vary depending on the machine used. Machine capacities for the next week and the unit costs are as follows: Machine Capaci ty (Units ) 1 1550 2 1450 3 1150 Produ ct Machin e A B C 1 $0. 0 $1. 0 $0. 0 2 $1. 0 $1. 0 $1. 0 3 $0. 0 $0. 0 $1. 0 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. If required, round your answers to one decimal place. The linear programming formulation and optimal solution are shown. Let x 1 A (^) = = Units of product A on machine 1 x 1 B Units of product B on machine 1

x 3 C Units of product C on machine 3

  1. If the acceptance of project A is conditional on the acceptance of project B, and vice versa, the appropriate constraint to use is a mutually exclusive constraint. multiple-choice constraint. corequisite constraint. k out of n alternatives constraint. 27. Problem 11-9 (Algorithmic) Hawkins Manufacturing Company produces connecting rods for 4- and 6-cylinder automobile engines using the same production line. The cost required to set up the production line to produce the 4-cylinder connecting rods is $2200, and the cost required to set up the production line for the 6-cylinder connecting rods is $3700. Manufacturing costs are $16 for each 4-cylinder connecting rod and $18 for each 6-cylinder connecting rod. Hawkins makes a decision at the end of each week as to which product will be manufactured the following week. If there is a production changeover from one week to the next, the weekend is used to reconfigure the production line. Once the line has been set up, the weekly production capacities are 5900 6- cylinder connecting rods and 8500 4-cylinder connecting rods. Let x 4 = the number of 4-cylinder connecting rods produced next week x 6 = the number of 6-cylinder connecting rods produced next week s 4 = 1 if the production line is set up to produce the 4-cylinder connecting rods; 0 if otherwise s 6 = 1 if the production line is set up to produce the 6-cylinder connecting rods; 0 if otherwise a. (^) Using the decision variables x 4 and s 4 , write a constraint that limits next week's production of the 4- (^) cylinder connecting rods to either 0 or 8500 units. b. (^) Using the decision variables x 6 and s 6 , write a constraint that limits next week's production of the 6- cylinder connecting rods to either 0 or 5900 units.

28. Problem 9- Bay Oil produces two types of fuels (regular and super) by mixing three ingredients. The major distinguishing feature of the two products is the octane level required. Regular fuel must have a minimum octane level of 90 while super must have a level of at least 100. The cost per barrel, octane levels, and available amounts (in barrels) for the upcoming two-week period are shown in the following table. Likewise, the maximum demand for each end product and the revenue generated per barrel are shown. Develop and solve a linear programming model to maximize contribution to profit. Let^ R i =^ the^ number^ of^ barrels^ of^ input^ i^ to^ use^ to^ produce^ Regular, i=1,2, S i = the number of barrels of input i to use to produce Super, i=1,2, If required, round your answers to one decimal place. For subtractive or negative numbers use a minus sign even if there is a + sign before the blank. (Example: -300)

29. Problem 15-7 (Algorithmic) Speedy Oil provides a single-server automobile oil change and lubrication service. Customers provide an arrival rate of 3.5 cars per hour. The service rate is 5 cars per hour. Assume that arrivals follow a Poisson probability distribution and that service times follow an exponential probability distribution.

  1. In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are λand μ? λ= 10, μ= 10 λ= 10, μ= 6 λ= 6, μ= 10 λ= 6, μ= 6