Rounded Branch and Bound Method for Mixed Integer Nonlinear Programming Problems: January 1977 (Classic Reprint)

Save £0.24
filler

Title: Hardback
Price:
Sale price£20.20 Regular price£20.44

Description

Excerpt from Rounded Branch and Bound Method for Mixed Integer Nonlinear Programming Problems: January 1977

In this paper, a method is described to solve integer nonlinear programming problems In this bounded Branch and Bound method, the arborescence has only N nodes, where N is the number of variables of the problem. Therefore, we store in the main memory of the computer only the informations relative to the N nodes. We can.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Details

Publisher - Forgotten Books

Author(s) - Jacob Akoka

Hardback

Published Date -

ISBN - 9780656402700

Dimensions - 22.9 x 15.2 x 0.9 cm

Page Count - 101

Paperback

Published Date -

ISBN - 9781332280681

Dimensions -

Page Count -

Payment & Security

American Express Apple Pay Diners Club Discover Maestro Mastercard Shop Pay Union Pay Visa

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

You may also like

Recently viewed