Linear programming with partial information
From MaRDI portal
Publication:1145068
DOI10.1016/0377-2217(80)90057-0zbMath0444.90059OpenAlexW2039727335MaRDI QIDQ1145068
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90057-0
Related Items (2)
Linear programming with a possibilistic objective function ⋮ Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
Cites Work
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- Proper efficiency and the theory of vector maximization
- On the cones of tangents with applications to mathematical programming
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Technical Note—Statistical Measures for Linear Functions on Polytopes
- The Vector Maximization Problem: Proper Efficiency and Stability
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Technical Note—Bayesian Decision Making with Ordinal Information
- Algorithms for the vector maximization problem
- Parametric Objective Function (Part 1)
- Parametric Objective Function (Part 2)—Generalization
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- A Necessary and Sufficient Qualification for Constrained Optimization
- Multiparametric Linear Programming
- Homogene mehrparametrische lineare Programmierung
This page was built for publication: Linear programming with partial information
