Solution of the Integer Concave Program Using the IC0N Algorithm. Volume 1.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1979
Accession Number
ADA077842

Entities

People

  • Harlan W. Loomis

Organizations

  • Naval Surface Warfare Center Dahlgren Division

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Composite Materials
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Convergence
  • Evolutionary Algorithms
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Plastic Explosives
  • Procedures (Computers)
  • Simplex Method
  • Systems Engineering

Readers

  • Operations Research