Solve the following Integer Linear Programming problem by using Branch and Bound method

Use dynamic programming to determine how many rows of each vegetable should I plan

 

Order Now
SKU: Ques79

Q1. CBC enterprises have three plants manufacturing sewing machine located at different locations. There are five sales offices located in different locations of the country. The shipping cost and details of production and marketing are given below.

Details of marketing                 

 

Sales offices Demand Sales price (Rs)
1 80 30
2 100 32
3 75 31
4 45 34
5 125 29

 

Details of production

Plant # Maximum production capacity ( No. of units) Production cost/unit (Rs)
1 150 20
2 200 22
3 125 18

 

Details of shipping cost (Rs)

sales

 

 

 

 

 

Find the production and distribution schedule that is most profitable to the company.

[Use VAM to determine the initial basic feasible solution].

 

Q2. Solve the following Integer Linear Programming problem by using Branch and Bound method (Use Graphical method only and clearly draw the tree diagram).

x

 

Q3. I have a small backyard garden that measures 10 20 feet. This spring I plan to plant three types of vegetables: tomatoes, green beans, and corn. The garden is organized in 10-foot rows. The corn and tomatoes rows are 2 feet wide, and the beans rows are 3 feet wide. I like tomatoes the most and beans the least, and a scale of 1 to 10, I would assign 10 to tomatoes, 7 to corn, and 3 to beans. Regardless of my preferences, my wife insists that I plan at least one row of green beans and no more than two rows of tomatoes. Use dynamic programming to determine how many rows of each vegetable should I plan?

 

Reviews

There are no reviews yet.

Be the first to review “Solve the following Integer Linear Programming problem by using Branch and Bound method”

Your email address will not be published. Required fields are marked *

Sorry no more offers available