Skip to main content

Advertisement

Log in

On Linear Inequality Systems with Smooth Coefficients

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A linear inequality system with infinitely many constraints is polynomial [analytical] if its index set is a compact interval of the real line and all its coefficients are polynomial [analytical] functions of the index on this interval. This paper provides sufficient conditions for a given closed convex set to be the solution set of a certain polynomial or at least analytical system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • M. A. Goberna M. A. López (1998) Linear Semi-Infinite Optimization Wiley Chichester, England

    Google Scholar 

  • E. J. Anderson A. S. Lewis (1989) ArticleTitleAn Extension of the Simplex Algorithm for Semi-Infinite Linear Programming Mathematical Programming 44 247–269

    Google Scholar 

  • E. J. Anderson P. Nash (1987) Linear Programming in Infinite-Dimensional Spaces Wiley Chichester, England

    Google Scholar 

  • T. León T. Vercher (1992) ArticleTitleA Purification Algorithm for Semi-Infinite Programming European Journal of Operations Research 57 412–420

    Google Scholar 

  • M. A. Goberna V. Jornet R. Puente I. M. Todorov (1999) ArticleTitleAnalytical Linear Inequality Systems and Optimization Journal of Optimization Theory and Applications 103 95–119

    Google Scholar 

  • T. León T. Vercher (1994) ArticleTitleNew Descent Rules for Solving the Linear Semi-Infinite Optimization Problem Operations Research Letters 15 105–114

    Google Scholar 

  • M. A. Goberna M. A. López (1995) ArticleTitleOptimality Theory for Semi-Infinite Linear Programming Numerical Functional Analysis and Optimization 16 669–700

    Google Scholar 

  • Jaume, D. and Puente, R., Conjugacy for Closed Convex Sets, Contributions to Algebra and Geometry (to appear).

  • D. Jaume R. Puente (2004) ArticleTitleRepresentability of Convex Sets by Analytical Linear Inequality Systems Linear Algebra and Its Applications 380 135–150

    Google Scholar 

  • R. T. Rockafellar (1970) Convex Analysis Princeton University Press Princeton, New Jersey

    Google Scholar 

  • Y. J. Zhu (1966) ArticleTitleGeneralizations of Some Fundamental Theorems on Linear Inequalities Acta Mathematica Sinica 16 25–40

    Google Scholar 

  • S. S. Abhyankar (1990) Algebric Geometry for Scientists and Engineers, Mathematical Surveys and Monographs American Mathematical Society Providence, Rhode Island

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The authors are indebted to Dr. J. M. Almira for valuable comments and suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goberna, M.A., Hernández, L. & Todorov, M.I. On Linear Inequality Systems with Smooth Coefficients. J Optim Theory Appl 124, 363–386 (2005). https://doi.org/10.1007/s10957-004-0941-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-004-0941-1

Keywords

Navigation