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...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 156; no. 3; pp. 325 - 338
Main Authors: Le Thi, Hoai An, Pham Dinh, Tao
Format: Journal Article Conference Proceeding
Language:English
Published: Lausanne Elsevier B.V 01.02.2008
Amsterdam Elsevier
New York, NY
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 minimization over linear constraints problems and then apply exact penalty techniques to state equivalent nondifferentiable polyhedral DC (Difference of Convex functions) programs. A new deterministic approach based on DC programming and DCA (DC Algorithms) is investigated to solve the latter ones. Finally numerical simulations are reported which show the efficiency, the robustness and the globality of our approach.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2007.03.024