Technical Note—Exact Solutions of Inexact Linear Programs
From MaRDI portal
Cited in
(35)- Design of non-parametric process-specific optimal tuning rules for PID control of flow loops
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Approaches to sensitivity analysis in linear programming
- Sufficient optimality conditions and duality theory for interval optimization problem
- Duality theory in interval-valued linear programming problems
- Robust linear optimization under general norms.
- Automatic robust convex programming
- Analysis of structure in fuzzy linear programs
- Wolfe duality for interval-valued optimization
- Duality theory for optimization problems with interval-valued objective functions
- On some optimization problems under uncertainty
- Appointment scheduling for medical diagnostic centers considering time-sensitive pharmaceuticals: a dynamic robust optimization approach
- Robust solutions of uncertain linear programs
- Robust nonlinear optimization with conic representable uncertainty set
- Connections between generalized, inexact and semi-infinite linear programming
- Optimality conditions and duality for arcwise connected interval optimization problems
- Duality for inexact linear programming problems∗
- Optimality conditions and duality results for non-differentiable interval optimization problems
- Some generalization of inexact linear programming
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- On interval-valued nonlinear programming problems
- Multiobjective programming in optimization of the interval objective function
- Objective function bounds for the inexact linear programming problem with generalized cost coefficients
- The quickest path problem with interval lead times
- Membership functions, some mathematical programming models and production scheduling
- Inexact linear programming with generalized technological matrix sets
- Inexact linear programming with generalized resource sets
- Strong duality for inexact linear programming
- Solution of integer programming problems with inexact data
- Integer programming problems with inexact data: Exact and approximate solutions
- ROPI -- a robust optimization programming interface for C++
- Relaxed robust second-order-cone programming
- Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming
- A robust optimization approach for multicast network coding under uncertain link costs
This page was built for publication: Technical Note—Exact Solutions of Inexact Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4102909)