Inexact linear programming with generalized resource sets

DOI10.1016/0377-2217(79)90227-3zbMATH Open0405.90044OpenAlexW1989757706MaRDI QIDQ1257413FDOQ1257413

Authors: K. Appert 

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90227-3

zbMATH Keywords

Generalized Resource SetsInexact Linear Programming

Mathematics Subject Classification ID

Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Cites Work

• Title not available (Why is that?)
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Constraint Qualifications for Inexact Linear Programs
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Title not available (Why is that?)
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (30)

• Duality Theory in Inexact Multiobjective Programming
• Satisfying solutions for a possibilistic linear program
• 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
• Wolfe duality for interval-valued optimization
• Duality theory for optimization problems with interval-valued objective functions
• On some optimization problems under uncertainty
• On the robust shortest path problem.
• Optimality conditions and duality for arcwise connected interval optimization problems
• Optimality conditions and duality results for non-differentiable interval optimization problems
• An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
• Robustness in operational research and decision aiding: a multi-faceted issue
• Goal programming problems with interval coefficients and target intervals
• 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
• A necessity measure of fuzzy inclusion relation in linear programming problems
• Decision making under uncertainty: A semi-infinite programming approach
• Objective function bounds for the inexact linear programming problem with generalized cost coefficients
• Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
• On 2-stage robust LP with RHS uncertainty: complexity results and applications
• Robust optimization by fuzzy linear programming
• Robust \(\epsilon\)-support vector regression
• Membership functions, some mathematical programming models and production scheduling
• Inexact linear programming with generalized technological matrix sets
• Convex optimization of interval valued functions on mixed domains
• Duality in inexact fractional programming with set-inclusive constraints
• Optimality conditions for generalized differentiable interval-valued functions
• On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity

This page was built for publication: Inexact linear programming with generalized resource sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1257413)