Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
From MaRDI portal
Publication:1835652
Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Proceedings, conferences, collections, etc. pertaining to calculus of variations and optimal control (49-06) Proceedings, conferences, collections, etc. pertaining to systems and control theory (93-06) Conference proceedings and collections of articles (00Bxx)
Cited in
(28)- Extensions of Gauss quadrature via linear programming
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- Generalized semi-infinite programming: a tutorial
- Some perturbation theory for linear programming
- A parallel algorithm for semi-infinite programming
- Effective computational procedure of the alternance optimization method
- Testing of monotonicity in parametric regression models
- An optimization approach to robust nonlinear control design
- Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions
- Semi-infinite programming
- Existence of augmented Lagrange multipliers for semi-infinite programming problems
- On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
- An exact penalty function for semi-infinite programming
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
- An interior-point method for semi-infinite programming problems
- Linear programming, complexity theory and elementary functional analysis
- Kuhn-Tucker curves for one-parametric semi-infinite programming
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- A new version of Farkas' lemma and global convex maximization
- A spline smoothing Newton method for semi-infinite minimax problems
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- An efficient algorithm for Elastic I‐optimal design of generalized linear models
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities
- A projected lagrangian algorithm for semi-infinite programming
- Inequality systems and optimization
- Discretization methods for the solution of semi-infinite programming problems
This page was built for publication: Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835652)
