Parametric Objective Function (Part 2)—Generalization
From MaRDI portal
Publication:5378659
DOI10.1287/OPRE.3.4.395zbMATH Open1414.90215OpenAlexW1969908936WikidataQ96159965 ScholiaQ96159965MaRDI QIDQ5378659FDOQ5378659
Publication date: 3 June 2019
Published in: Journal of the Operations Research Society of America (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.3.4.395
Cited In (14)
- Linear programming with partial information
- DEA-type models for designing optimal systems and determining optimal budgets
- Calmness of the Optimal Value in Linear Programming
- Lipschitz modulus of the optimal value in linear programming
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
- An algebraic model for the propagation of errors in matrix calculus
- Another look at linear programming for feature selection via methods of regularization
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Lipschitzian stability in linear semi-infinite optimization
- Lipschitz upper semicontinuity in linear optimization via local directional convexity
- The compromise hypersphere for multiobjective linear programming
- Solving Large Batches of Linear Programs
- An approximation algorithm for a general class of multi-parametric optimization problems
- Multiobjective model predictive control
This page was built for publication: Parametric Objective Function (Part 2)—Generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378659)
