Strictly Concave Parametric Programming, Part I: Basic Theory

DOI10.1287/MNSC.13.3.244MaRDI QIDQ5519740zbMATH OpenOpenAlexFDO

Authors A. M. Geoffrion

Publication date 1966

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.13.3.244

zbMATH Keywords

operations research

Cited in

(14)

• On efficient sets in vector maximum problems - A brief survey
• Programmazione lineare con piu funzioni obiettivo
• The structure of admissible points with respect to cone dominance
• Analytic efficient solution set for multi-criteria quadratic programs
• A note on composite concave quadratic programming
• Sensitivity and parametric bound analysis for a single pass machining problem
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Methods of parametric non-linear programming
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Analytic efficient solution set for bi-criteria quadratic network programs
• HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS
• A revised simplex method for linear multiple objective programs
• Problems and methods with multiple objective functions
• Interactive multiple objective optimization: Survey. I: Continuous case

This page was built for publication: Strictly Concave Parametric Programming, Part I: Basic Theory

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