An average of 4,000 people is traveling through road from City NJ to City NY. Non-linear programming (NLP): Non-linear programming (NLP) is used in complex optimization problems where the objectives or constraints or sometimes both are non-linear functions of the decision variables. A model can be termed as non-linear for more than one reason.

Question

A company possesses two manufacturing plants, each of which can produce three products, X, Y, and Z, from a common raw material. However, the proportion in which the products are produced differs in each plant, and so are plant's operating costs per hour. Data on production per hour and costs are given below, together with current orders in hand of each product. Products Operating cost per hour Y Plant A 4 9. Plant B 4 2 10 Orders on hand 50 24 60 Formulate the above as a linear programming problem. Find the number of production hours needed to fulfill the orders on hand at minimum cost using the using Big M method.

Answer 1

Question

Chapter 7, Problem 70P

a)

Summary Introduction

To show: An average of 4,000 people is traveling through road from City NJ to City NY.

Non-linear programming (NLP):

Non-linear programming (NLP) is used in complex optimization problems where the objectives or constraints or sometimes both are non-linear functions of the decision variables. A model can be termed as non-linear for more than one reason.

b)

Summary Introduction

To show: The average travel time per person is minimized if 2,000 people travel by road.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

A company possesses two manufacturing plants, each of which can produce three products, X, Y, and Z, from a common raw material. However, the proportion in which the products are produced differs in each plant, and so are plant's operating costs per hour. Data on production per hour and costs are given below, together with current orders in hand of each product. Products Operating cost per hour Y Plant A 4 9. Plant B 4 2 10 Orders on hand 50 24 60 Formulate the above as a linear programming problem. Find the number of production hours needed to fulfill the orders on hand at minimum cost using the using Big M method.

Solve the question below using the attached excel templates with formulas for renting both slow and fast copies (labeled in the excel tabs). Question: The Decision Sciences Department is trying to determine whether to rent a slow or a fast copier. The department believes that an employee’s time is worth $15 per hour. The slow copier rents for $4 per hour, and it takes an employee an average of 10 minutes to complete copying. The fast copier rents for $15 per hour, and it takes an employee an average of six minutes to complete copying. On average, four employees per hour need to use the copying machine. (Assume the copying times and interarrival times to the copying machine are exponentially distributed.) Which machine should the department rent to minimize expected total cost per hour?