On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods

Abstract

The computation of the analytic center of the solution set can be important in linear programming applications where it is desirable to obtain a solution that is not near the relative boundary of the solution set. In this work we discuss the effective computation of the analytic center solution by the use of primal-dual interior-point methods. A primal-dual interior-point algorithm designed for effectively computing the analytic center solution is proposed and theory and numerical results are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 14, 1996
Accession Number
ADA445646

Entities

People

  • Florian A. Potra
  • Maria D. Gonzalez-lima
  • Richard A. Tapia

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Boundaries
  • Computations
  • Heuristic Methods
  • Information Operations
  • Linear Programming
  • Mathematical Analysis
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Technical Research and Report Writing.