Integer Programming

A linear programming problem is used to find either the maximum or minimum of an objective function subject to some constraints. These constraints are usually inequalities. When these constraints are satisfied one obtains a feasible solution. When one of these solutions is either the maximum or the minimum as per what the objective function, one gets an optimum solution/

In many real life situations one may require that the decision variables be integer as one has to find out number of buses required or no of staff required to be deployed etc., Such classes of problems are called as Integer Programming problems.

Integer programming problems cannot be solved using the Simplex method, they need to be solved by using the branch and bound method. One can imagine the feasible region enclosed by the constraints in a convex optimization problem with horizontal and vertical lines drawn at each integer point. The solution to the Integer Linear Programming problem will hence fall on any of the horizontal or vertical lines inside the feasible region. The feasible set is no longer convex and becomes very arduous to solve due to is non convex nature.

There are several different types of methods used to solve Integer Linear Programming problems. The most commonly used method is the branch and bound method.

Branch and Bound involves relaxing the Integer constraints and solving the linear program using either the graphical or the simplex method. If after relaxing the integer constraints, all the decision variables turn out to be integers, then the solution set is correct.

However if the solution to the relaxed linear program does not yield integer values as solutions of the decision variables one has to employ a branch and bound technique by solving the original problem with a bounded integer value of the decision variable added to the set of constraints. When this new problem set is solved, if it yields an optimum value with integer values, then there may be better values and so other branches have to be investigated. Eventually the solution has to be picked from one of the nodes in the branches visited which is either the maximum or the minimum. We have to keep repetitively solving a linear relaxation of the problem with newer integer bounds and check for the best possible solution in the context. For a lower dimensional Integer Programming problem it may be better to use a graphical method to solve the problem.

An extension of the Integer Programming problem is the 0-1 integer programming problem where decision variables can take only 0 or 1. These kind of problems are especially useful to solve problems similar to the knap sack problem.

Related Posts

Gwen Josephine

Next Post

Treat Yourself and Your Vehicle With New Window Tinting, Car Detailing, and More!

Fri Apr 22 , 2022
Take your vehicle to the next level with car audio video customization and more! You work hard, so you deserve to play hard–contact your local car electronics shop to get started today. Whether you’ve been putting in long hours at the office, or you’re working your fingers to the bone […]

You May Like

Finance management Business development Business strategy Business operations Business management Business growth Business analysis Industry trends Financial analysis Industry insights Industry challenges Manufacturing process Manufacturing industry Manufacturing technologies Parenting Family Journalism Lifestyle blog Current events Breaking news Media coverage Educational trends Scientific community STEM (Science, Technology, Engineering, and Mathematics) Legal support team Legal regulations compliance Intellectual property laws Career success Education software Online learning platforms Civil rights protection Corporate legal compliance Legal guidance blog Cybersecurity Social media marketing Digital transformation Network infrastructure Internet of Things (IoT) Web development Software maintenance Software engineering Mobile apps E-commerce platforms User experience (UX) design User interface (UI) design Responsive web design Artificial intelligence (AI) Car accessories Automotive engineering Car maintenance Adventure travel Car technology Vehicle Automotive trends Automotive industry analysis Car brands Healthy lifestyle Nutrition and wellness Dermatology services Cosmetic procedures Plastic surgery Alternative medicine Fitness exercises Mental health Yoga and meditation Oral health Fashion Women's fashion Skincare routine Wedding flowers Fashion accessories Online fashion community Online shopping Fashion tips Pet Health Services Veterinary Care Shelter and Rescue Home renovation ideas Interior design inspiration Home decor trends mart home technology Real estate market trends Rental property management Gardening and landscaping tips Home remodeling and renovations Moving and packing services Professional home cleaning furniture and accessories Art and design workshops Art and culture events Art festivals and fairs Visual arts and crafts Outdoor adventures Sports events sports Gaming community Outdoor family activities Gastronomy Food tourism Food exploration Vacation Holiday Tourist Attractions Travel destinations Leisure activities Weekend getaway Travel experiences News reporting Residential services Big Data Real estate agent selection Parenting Guides Pool maintenance and cleaning Fashion industry news health shop Data analytics Community Press release zoom news info Health and wellness tips data macau travel Medical treatments school trips plus uk Legal assistance Parenting Tips puppy love pets uk Automotive manufacturing Exterior home improvement Travel tips Headlines Food culture Automotive industryCriminal Law Healthcare services school Trip sports Equipment dental Beauty Education International