Scribd
Upload
267 views

Integer - Programming - PPT (Compatibility Mode)

The document discusses several integer programming problems including classic knapsack problems, capital budgeting problems, blending problems, production planning problems, and product mix problems. Each problem involves optimizing an objective such as profit or value subject to constraints like limited resources or technical restrictions. The problems are formulated as integer programs to find the best solution that satisfies the constraints.

Uploaded by

Harsh Bhardwaj
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
267 views

Integer - Programming - PPT (Compatibility Mode)

The document discusses several integer programming problems including classic knapsack problems, capital budgeting problems, blending problems, production planning problems, and product mix problems. Each problem involves optimizing an objective such as profit or value subject to constraints like limited resources or technical restrictions. The problems are formulated as integer programs to find the best solution that satisfies the constraints.

Uploaded by

Harsh Bhardwaj
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Integer Programming

Classic Knapsack Problem


You want to maximize the value of items you can pack into a single suitcase (or knapsack). However, you are limited to a weight of 50 lbs.
Item A B C D E Value ($) 15 20 18 13 12 Weight (lbs) 18 10 21 11 11

xi = 0 if not chosen = 1 if put in knapsack

Classic Knapsack Problem


Solving the problem: --- Without Integer constraints --- With Integer constraints

What is the difference in solution?

Additional constraints (Integer Problem version): --- could not select item A without selecting item D --- you could select at most 3 items

Capital Budgeting Problem


There are four possible projects, which each run for 3 years and have the following characteristics. Capital requirements Project 1 2 3 4 Return 0.2 0.3 0.5 0.1 Year 1 0.5 1.0 1.5 0.1 3.1 2 0.3 0.8 1.5 0.4 2.5 3 0.2 0.2 0.3 0.1 0.4

Available capital return?

Which projects would you choose in order to maximise the total

Capital Budgeting Problem


Additional constraint: Either project 1 or project 2 needs to be chosen.

Integer Programming Applications


imposition of logical conditions in LP problems (such as the either/or condition dealt in previous example) blending with a limited number of ingredients depot location job shop scheduling assembly line balancing airline crew scheduling timetabling

Blending Problem
Consider the example of a manufacturer of animal feed who is producing feed mix for dairy cattle. The feed mix contains two active ingredients and a filler to provide bulk. One kg of feed mix must contain a minimum quantity of each of four nutrients as below: Nutrient gram A 90 B 50 C 20 D 2

The ingredients have the following nutrient values and cost A Ingredient 1 (gram/kg) 100 Ingredient 2 (gram/kg) 200 kg of feed mix?
7

B 80 150

C 40 20

D 10 -

Cost/kg 40 60

What should be the amounts of active ingredients and filler in one

Blending Problem additional constraints


if we use any of ingredient 2 we incur a fixed cost of 15 we need not satisfy all four nutrient constraints but need only satisfy three of them

Production Planning Problem


In the planning of the monthly production for the next six months a company must, in each month, operate either a normal shift or an extended shift (if it produces at all). A normal shift costs 100,000 per month and can produce up to 5,000 units per month. An extended shift costs 180,000 per month and can produce up to 7,500 units per month. Note here that, for either type of shift, the cost incurred is fixed by a union guarantee agreement and so is independent of the amount produced.

It is estimated that changing from a normal shift in one month to an extended shift in the next month costs an extra 15,000. No extra cost is incurred in changing from an extended shift in one month to a normal shift in the next month.
9

Production Planning Problem (cont)


The cost of holding stock is estimated to be 2 per unit per month (based on the stock held at the end of each month) and the initial stock is 3,000 units (produced by a normal shift). The amount in stock at the end of month 6 should be at least 2,000 units. The demand for the company's product in each of the next six months is estimated to be as shown below: Month 1 2 6,500 3 7,500 4 7,000 5 6,000 6 6,000

Demand 6,000

Production constraints are such that if the company produces anything in a particular month it must produce at least 2,000 units. The company wants a production plan for the next six months that avoids stockouts, formulate their problem as an integer program. 10

Production Planning Another Example


A toy manufacturer is planning to produce new toys. The setup cost of the production facilities and the unit profit for each toy are given below. :

Toy 1 2

Setup cost () 45000 76000

Profit () 12 16

The company has two factories that are capable of producing these toys. In order to avoid doubling the setup cost only one factory could be used.

11

Production Planning Another Example (cont)


The production rates of each toy are given below (in units/hour):

Toy 1 Factory 1 Factory 2 52 42

Toy 2 38 23

Factories 1 and 2, respectively, have 480 and 720 hours of production time available for the production of these toys. The manufacturer wants to know which of the new toys to produce, where and how many of each (if any) should be produced so as to maximise the total profit.
12

Capital Investment Problem


A project manager in a company is considering a portfolio of 10 large project investments. These investments differ in the estimated long-run profit (net present value) they will generate as well as in the amount of capital required.

Let Pj and Cj denote the estimated profit and capital required (both given in units of millions of ) for investment opportunity j (j=1,...,10) respectively. The total amount of capital available for these investments is Q (in units of millions of )

13

Capital Investment Problem (cont)


Investment opportunities 3 and 4 are mutually exclusive and so are 5 and 6. Furthermore, neither 5 nor 6 can be undertaken unless either 3 or 4 is undertaken. At least two and at most four investment opportunities have to be undertaken from the set {1,2,7,8,9,10}.

The project manager wishes to select the combination of capital investments that will maximise the total estimated long-run profit subject to the restrictions described above.

14

Food Mix Problem


A food is manufactured by refining raw oils and blending them together. The raw oils come in two categories: Vegetable oil: VEG1 Non-vegetable oil: VEG2 OIL1 OIL2 OIL3

The prices for buying each oil are given below (in /tonne) VEG1 VEG2 OIL1 OIL2 OIL3 115 128 132 109 114

15

Food Mix Problem (cont)


The final product sells at 180 per tonne. Vegetable oils and nonvegetable oils require different production lines for refining. It is not possible to refine more than 210 tonnes of vegetable oils and more than 260 tonnes of non-vegetable oils. There is no loss of weight in the refining process and the cost of refining may be ignored. There is a technical restriction relating to the hardness of the final product. In the units in which hardness is measured this must lie between 3.5 and 6.2. It is assumed that hardness blends linearly and that the hardness of the raw oils is:
VEG1 VEG2 OIL1 OIL2 OIL3 8.8 6.2 1.9 4.3 5.1

It is required to determine what to buy and how to blend the raw oils so that the company maximises its profit.
16

Food Mix Problem (cont)


Additional Constraints:

the food may never be made up of more than 3 raw oils if an oil (vegetable or non-vegetable) is used, at least 30 tonnes of that oil must be used if either of VEG1 or VEG2 are used then OIL2 must also be used

17

Product Mix Problem


A company is attempting to decide the mix of products which it should produce next week. It has seven products, each with a profit () per unit and a production time (man-hours) per unit as shown below: Product 1 2 3 4 5 6 7 Profit ( per unit) 10 22 35 19 55 10 115 Production time (man-hours per unit) 1.0 2.0 3.7 2.4 4.5 0.7 9.5
18

Product Mix Problem (cont)


The company has 720 man-hours available next week.

Formulate the problem of how many units (if any) of each product to produce next week as an integer program in which all the constraints are linear.

19

Product Mix Problem (cont)


Additional Constraints:

If any of product 7 are produced an additional fixed cost of 2000 is incurred. Each unit of product 2 that is produced over 100 units requires a production time of 3.0 man-hours instead of 2.0 man-hours (e.g. producing 101 units of product 2 requires 100(2.0) + 1(3.0) manhours). If both product 3 and product 4 are produced 75 man-hours are needed for production line set-up and hence the (effective) number of man-hours available falls to 720 - 75 = 645.
20

You might also like