Relaxation of the Equality Constrained Convex Continuous Knapsack Problem

Stefan M. Stefanov ()
Additional contact information
Stefan M. Stefanov: South-West University Neofit Rilski

Chapter Chapter 15 in Separable Optimization, 2021, pp 281-284 from Springer

Abstract: Abstract In this chapter, problem $$(C^=)$$ ( C = ) , defined by (6.1)–(6.3) in Chapter Six of Part Two, is considered again. Necessary and sufficient condition (characterization theorem) for problem $$(C^=)$$ ( C = ) is stated and proved in terms of a relaxed versionKnapsackproblemrelaxed (6.1)–(6.2) of this problem.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-78401-0_15

Ordering information: This item can be ordered from
http://www.springer.com/9783030784010

DOI: 10.1007/978-3-030-78401-0_15

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().