Technical Note—Duality Theory for Generalized Linear Programs With Computational Methods

Operations Research - United States
doi 10.1287/opre.28.4.1005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1975English

Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2010English

Technical Note—On Converse Duality for a Nondifferentiable Programming Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1977English

Technical Note—An Implementation of Surrogate Constraint Duality

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1978English

Technical Note—A Generalized Maximum Entropy Principle

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1979English

Technical Note—Statistical Measures for Linear Functions on Polytopes

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1976English

Computational Methods and Function Theory

Lecture Notes in Mathematics
Number TheoryAlgebra
1990English

Note on Pseudolattices, Lattices and Submodular Linear Programs

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2008English

Parallel Successive Overrelaxation Methods for Symmetric Linear Complementarity Problems and Linear Programs

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy