Linear programming with partial information
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- A Necessary and Sufficient Qualification for Constrained Optimization
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Algorithms for the vector maximization problem
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Generating all maximal efficient faces for multiple objective linear programs
- Homogene mehrparametrische lineare Programmierung
- Multiparametric Linear Programming
- On the cones of tangents with applications to mathematical programming
- Parametric objective function. I
- Parametric objective function. II. Generalization
- Proper efficiency and the theory of vector maximization
- Technical Note—Bayesian Decision Making with Ordinal Information
- Technical Note—Statistical Measures for Linear Functions on Polytopes
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The Vector Maximization Problem: Proper Efficiency and Stability
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(2)
This page was built for publication: Linear programming with partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145068)
