A continuous approach for the concave cost supply problem via DC programming and DCA

The paper addresses an important but difficult class of concave cost supply management problems which consist in minimizing a separable increasing concave objective function subject to linear and disjunctive constraints. We first recast these problems into mixed zero-one nondifferentiable concave mi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 156; H. 3; S. 325 - 338
Hauptverfasser:	Le Thi, Hoai An, Pham Dinh, Tao
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Lausanne Elsevier B.V 01.02.2008 Amsterdam Elsevier New York, NY
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Concave cost supply problem Concave programming DC (Difference of Convex functions) programming DCA Disjunctive constraints Exact penalty Exact sciences and technology Mathematics Mixed 0-1 concave programming Reformulation Sciences and techniques of general use Theoretical computing Concave programming Exact penalty DCA DC (Difference of Convex functions) programming Reformulation Disjunctive constraints Concave cost supply problem Mixed 0-1 concave programming Costs Optimization method Convex programming Penalty method Efficiency Increasing function Convex function Robustness Combinatorics Deterministic approach Computer theory Minimization Management Algorithm Constrained optimization Concave function Numerical simulation Mixed problem Objective function
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!