A New Algorithm for State-Constrained Separated Continuous Linear Programs (Q4237218)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1272834
Language Label Description Also known as
default for all languages
No label defined
    English
    A New Algorithm for State-Constrained Separated Continuous Linear Programs
    scientific article; zbMATH DE number 1272834

      Statements

      A New Algorithm for State-Constrained Separated Continuous Linear Programs (English)
      0 references
      0 references
      0 references
      31 March 1999
      0 references
      continuous linear programming
      0 references
      strong duality
      0 references
      semi-infinite linear programming
      0 references
      nonlinear programming
      0 references
      jobshop scheduling problems
      0 references
      A continuous linear program is considered, with two state functions \(u(.)\) and \(y(.)\), a constraint \[ \int^t_0 Gu(s)ds+ Ey(t)=a(t) \] with \(a(.)\) piecewise linear, and separate pointwise linear inequalities for \(u(.)\) and \(y(.)\), with piecewise constant right sides. This class (SCSCLP) of problems is stated to give important models for manufacturing and communication systems. A strong duality theorem is proved. An algorithm is proposed to solve SCSCLP, requiring computing KKT points for a number of nonconvex quadratic programming subproblems with polyhedral constraints. Convergence and termination are proved; zero duality gap follows from the algorithm. A numerical application is included, with up to 250 continuous variables, showing the effectiveness of the algorithm.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references