Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs
From MaRDI portal
Publication:1935266
DOI10.1007/s10957-012-0089-3zbMath1279.90168OpenAlexW1999065700MaRDI QIDQ1935266
Ya-Ping Fang, Xiao Qi Yang, Nan-Jing Huang
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0089-3
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items (3)
On finite linear systems containing strict inequalities ⋮ Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces ⋮ Local smooth representation of solution sets in parametric linear fractional programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- Introduction to sensitivity and stability analysis in nonlinear programming
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
- Nonconvex, lower semicontinuous piecewise linear optimization
- Multiparametric linear programming: support set and optimal partition invariancy
- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Discontinuous piecewise linear optimization
- Sensitivity analysis in linear optimization: invariant support set intervals
- A Minimax Portfolio Selection Rule with Linear Programming Solution
- Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
- Lectures on Polytopes
- Smooth representation of a parametric polyhedral convex set with application to sensitivity in optimization
- Differentiable selection of optimal solutions in parametric linear programming
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization
- Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints
- Convex Analysis
This page was built for publication: Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs
