Title : ( Solving a Class of Separated Continuous Programming Problems Using Linearization and Discretization )
Authors: Hamid Reza Erfanian , mohammad hadi noori skandari , Ali Vahidian Kamyad ,
Full TextAbstract
In this paper we present a new approach for solving a class of separated continuous programming (SCP) problems using convex combination property of intervals. By convex combination property of intervals, we transform the SCP problems to the corresponding linear problems. Moreover, discretization method is applied to convert the new problem to a discrete-time problem which we solve it by linear programming methods. Finally, some numerical examples are given to show the efficiency of the proposed approach.
Keywords
SCP problem; Convex combination; Discretization; linear programming
@article{paperid:1025038,
author = {Erfanian, Hamid Reza and Noori Skandari, Mohammad Hadi and Vahidian Kamyad, Ali},
title = {Solving a Class of Separated Continuous Programming Problems Using Linearization and Discretization},
journal = {International journal of sensing, computing & control},
year = {2011},
volume = {1},
number = {2},
month = {December},
issn = {2185-0763},
pages = {117--124},
numpages = {7},
keywords = {SCP problem; Convex combination; Discretization; linear programming},
}
%0 Journal Article
%T Solving a Class of Separated Continuous Programming Problems Using Linearization and Discretization
%A Erfanian, Hamid Reza
%A Noori Skandari, Mohammad Hadi
%A Vahidian Kamyad, Ali
%J International journal of sensing, computing & control
%@ 2185-0763
%D 2011
