Technical Note—Exact Solutions of Inexact Linear Programs

DOI10.1287/OPRE.24.4.783zbMath0335.90035DBLPjournals/ior/Falk76OpenAlexW2120974482WikidataQ91469719 ScholiaQ91469719MaRDI QIDQ4102909

James E. Falk

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.4.783

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (35)

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

This page was built for publication: Technical Note—Exact Solutions of Inexact Linear Programs