Heuristic-Approaches To Some Integer Programming Problems - Couverture souple

Alam, Teg

 
9783659954542: Heuristic-Approaches To Some Integer Programming Problems
Couverture souple
ISBN 10 : 3659954543 ISBN 13 : 9783659954542
Editeur : LAP LAMBERT Academic Publishing, 2016

Synopsis

Integer programming Problem is concerned with the optimization problems in which some or all of the variables are required to take on discrete values. Solution methods of Integer programming can be classified as an ‘optimal’ and a ‘heuristic’. An ‘optimal’ tactic is one which mathematically guarantees to find the optimal solution. A ‘Heuristic’ approach is a tactic that should optimistically find a feasible solution. In fact, it is often the case that a well-designed heuristic approaches can give good quality (near-optimal) results. This book consists of five chapters, starting with an introductory chapter and deals with the study of Integer programming problem. The present book provides the some heuristic approaches for finding the integer solutions. It also provides insight on the ‘A-T’ cut and some special cuts. The cuts are developed to reduce the feasible region under which an optimum solution is achieved in a minimum number of steps. The computational details of the procedure are illustrated through the numerical examples. This book can also develop awareness among the researcher regarding establishing the new ideas to form the cuts and the heuristic approaches.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Integer programming Problem is concerned with the optimization problems in which some or all of the variables are required to take on discrete values. Solution methods of Integer programming can be classified as an ‘optimal’ and a ‘heuristic’. An ‘optimal’ tactic is one which mathematically guarantees to find the optimal solution. A ‘Heuristic’ approach is a tactic that should optimistically find a feasible solution. In fact, it is often the case that a well-designed heuristic approaches can give good quality (near-optimal) results. This book consists of five chapters, starting with an introductory chapter and deals with the study of Integer programming problem. The present book provides the some heuristic approaches for finding the integer solutions. It also provides insight on the ‘A-T’ cut and some special cuts. The cuts are developed to reduce the feasible region under which an optimum solution is achieved in a minimum number of steps. The computational details of the procedure are illustrated through the numerical examples. This book can also develop awareness among the researcher regarding establishing the new ideas to form the cuts and the heuristic approaches.

Biographie de l'auteur

Dr. Teg Alam is a faculty member of the College of Business Administration, Prince Sattam bin Abdulaziz University, Al-Kharj; Kingdom of Saudi Arabia. Before joining this University, he worked at ICCMRT, Lucknow and Azad Institute of Engineering and Technology, Lucknow as an Associate Professor. He completed his Ph.D.(Operations Research) in 2004.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2016
Langue
anglais
ISBN 10 
3659954543
ISBN 13 
9783659954542
Reliure
Broché
Nombre de pages
152
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne