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.

At a small but growing airport, the local airline company is purchasing a new tractor for a tractor-trailer train to bring luggage to and from the airplanes. A new mechanized luggage system will be installed in 3 years, so the tractor will not be needed after that. However, because it will receive heavy use, so that the running and maintenance costs will increase rapidly as the tractor ages, it may still be more economical to replace the tractor after 1 or 2 years. The following table gives the total net discounted cost associated with purchasing a tractor (purchase price minus trade-in allowance, plus running and maintenance costs) at the end of year i and trading it in at the end of year j (where year O is now). i 012 1 $13,000 j 2 $28,000 $17,000 3 $48,000 $33,000 $20,000 The problem is to determine at what times (if any) the tractor should be replaced to minimize the total cost for the tractors over 3 years. (a) Formulate this problem as a minimum cost flow problem by showing the…

At a small but growing airport, the local airline company is purchasing a new tractor for a tractor-trailer train to bring luggage to and from the airplanes. A new mechanized luggage system will be installed in 3 years, so the tractor will not be needed after that. However, because it will receive heavy use, so that the running and maintenance costs will increase rapidly as the tractor ages, it may still be more economical to replace the tractor after 1 or 2 years. The following table gives the total net discounted cost associated with purchasing a tractor (purchase price minus trade-in allowance, plus running and maintenance costs) at the end of year i and trading it in at the end of year j (where year O is now). i B 012 1 $13,000 j 2 $28,000 $17,000 3 $48,000 $33,000 $20,000 The problem is to determine at what times (if any) the tractor should be replaced to minimize the total cost for the tractors over 3 years. (a) Formulate this problem as a shortest-path problem by drawing a…