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

DOI10.1007/BF00934321zbMath0472.90047MaRDI QIDQ1158342

Chanchal Singh

Publication date: 1982

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

zbMATH Keywords

generalized linear programmingset-inclusive constraints

Mathematics Subject Classification ID

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

Related Items (8)

A class of multiple-criteria fractional programming problems ⋮ Multiobjective fractional programming duality theory ⋮ 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 ⋮ 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

Cites Work

• Unnamed Item
• Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
• Technical Note—Exact Solutions of Inexact Linear Programs
• Duality in Fractional Programming: A Unified Approach
• 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
• Erratum

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