Sensitivity analysis methods for a crop-mix problem in linear programming

DOI10.1007/BF01918247zbMath0187.41902OpenAlexW2005381351MaRDI QIDQ5581184

B. C. Sanyal, Jati K. Sengupta

Publication date: 1970

Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01918247

zbMATH Keywords

operations research

Related Items (1)

Adaptive decision rules for stochastic linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the stability of solutions under error in stochastic linear programming
• On stochastic linear programming. The Laplace transform to the distribution of the optimum and applications
• On the weak convergence in locally uniformly convex spaces
• ERRORS AND STOCHASTIC VARIATIONS IN LINEAR PROGRAMMING
• A Stochastic Programming Model
• The Stability of Truncated Solutions of Stochastic Linear Programming
• On the Probability Distribution of the Optimum of a Random Linear Program
• Statistical decision analysis of stochastic linear programming problems
• Rules for Rejection of Outliers
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Extremal Properties of Extreme Value Distributions
• Safety First and the Holding of Assets
• On the Distribution of the Ratio of the ith Observation in an Ordered Sample from a Normal Population to an Independent Estimate of the Standard Deviation
• The Number of Vertices of a Polyhedron

This page was built for publication: Sensitivity analysis methods for a crop-mix problem in linear programming