Optimization Online


On duality theory of conic linear problems

Alexander Shapiro (ashapiro***at***isye.gatech.edu)

Abstract: In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate duality approach where the questions of ``no duality gap" and existence of optimal solutions are related to properties of the corresponding optimal value function. We discuss in detail applications of the abstract duality theory to the problem of moments, linear semi-infinite and continuous linear programming problems.


Category 1: Infinite Dimensional Optimization

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Category 3: Linear, Cone and Semidefinite Programming (Cone Programming )


Download: [PDF]

Entry Submitted: 08/21/2000
Entry Last Modified: 11/15/2000

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society