Solution of the Integer Concave Program Using the IC phi N Algorithm, Volume 2.

Abstract

The branch-and-bound technique has been the basis for algorithms to solve both the mixed integer linear program (having linear objective function, linear constraints, and integrality restrictions on some variables) and the concave nonlinear program (having a separable concave objective function and linear constraints). The subprograms for each of these branch-and-bound algorithms are linear programs with simple upper bounds. In Volume 1, a new branch-and-bound algorithm is presented for the composite mixed integer, concave nonlinear program. This integer concave (IC0N) algorithm has been implemented in the form of a computer program coded in FORTRAN. A guide to the use of the computer program together with examples of its application are included in Volume 1. Documentation of the computer program is included in Volume 2. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1978
Accession Number
ADA062012

Entities

People

  • Harlan W. Loomis

Organizations

  • Naval Surface Warfare Center Dahlgren Division

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Core Storage
  • Linear Programming
  • Mass Storage
  • Operations Research
  • Optimization
  • Procedures (Computers)
  • Simplex Method

Readers

  • Computer Science.
  • Operations Research