Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming

DOI10.1007/BF00934321MaRDI QIDQ1158342zbMATH OpenFDO

Authors Chanchal Singh

Publication date 1982

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

generalized linear programmingset-inclusive constraints

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Linear programming (90C05) Convex programming (90C25) Fractional programming (90C32)

Cites work

• Duality in Fractional Programming: A Unified Approach
• Erratum
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
• Technical Note—Exact Solutions of Inexact Linear Programs

Cited in

(8)

• A class of multiple-criteria fractional programming problems
• Robust solutions of uncertain linear programs
• Minimax programming as a tool for studying robust multi-objective optimization problems
• A robust optimization approach for a cellular manufacturing system considering skill-leveled operators and multi-functional machines
• Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
• Multiobjective Programming Strong Vector Duality
• Matrix Programming with Set-Inclusive Constraints and Objective Set
• Multiobjective fractional programming duality theory

This page was built for publication: Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming

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