A simplex based algorithm to solve separated continuous linear programs

Gideon Weiss

doi:10.1007/s10107-008-0217-x

A simplex based algorithm to solve separated continuous linear programs

Gideon Weiss

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.

Original language	English
Pages (from-to)	151-198
Number of pages	48
Journal	Mathematical Programming
Volume	115
Issue number	1
DOIs	https://doi.org/10.1007/s10107-008-0217-x
State	Published - Sep 2008

Keywords

Continuous linear programming
Simplex method

ASJC Scopus subject areas

Software
General Mathematics

Access to Document

10.1007/s10107-008-0217-x

Cite this

@article{e2027f3af6124739a5d4e36f739b8f9f,

title = "A simplex based algorithm to solve separated continuous linear programs",

abstract = "We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.",

keywords = "Continuous linear programming, Simplex method",

author = "Gideon Weiss",

year = "2008",

month = sep,

doi = "10.1007/s10107-008-0217-x",

language = "English",

volume = "115",

pages = "151--198",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1",

}

TY - JOUR

T1 - A simplex based algorithm to solve separated continuous linear programs

AU - Weiss, Gideon

PY - 2008/9

Y1 - 2008/9

N2 - We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.

AB - We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.

KW - Continuous linear programming

KW - Simplex method

UR - https://www.scopus.com/pages/publications/43949110568

U2 - 10.1007/s10107-008-0217-x

DO - 10.1007/s10107-008-0217-x

M3 - Article

AN - SCOPUS:43949110568

SN - 0025-5610

VL - 115

SP - 151

EP - 198

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -

A simplex based algorithm to solve separated continuous linear programs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this